simple base64 decoder, not particularly efficient, but small */

encode as base64, returning allocated string */

64 bit crc from ArduPilot */

create a romfs_embedded.h file

Main algorithm

Elligator inverse map Computes the representative of a point, if possible. If not, it does nothing and returns -1. Note that the success of the ope

"Fast" dirty ephemeral key We use this one by default. This version works by performing a regular scalar multiplication, then add a low order point.

embed one file

The compression function G (copy version for the first pass)

The compression function G (xor version for subsequent passes)

P = [b]B + [p]P, where B is the base point Variable time! Internal buffers are not wiped! Inputs must not be secret! => Use only to *check* signature

h = s, where s is a point encoded in 32 bytes Variable time! Inputs must not be secret! => Use only to *check* signatures. From the specifications:

R_check = s[B] - h_ram[pk], where B is the base point Variable time! Internal buffers are not wiped! Inputs must not be secret! => Use only to *check

Internal buffers are not wiped! Inputs must not be secret! => Use only to *check* signatures.

get private key, return 32 byte key or None

check if BasicID info is filled in with parameters */

create a json string from a table */

request a session key

send remoteid config change

set parameter from a float */

build the fixed huffman trees */

given a data stream, decode dynamic trees from it */

given a stream and two trees, inflate a block of data */

inflate an uncompressed block of data */

initialize decompression structure */

constructor

abstraction for MAVLink on a serial port */

check we are OK to arm */

printf to CAN LogMessage for debugging