wnaf.test.cpp File Reference

#include "wnaf.hpp"
#include "../curves/bn254/fr.hpp"
#include "barretenberg/numeric/random/engine.hpp"
#include <gtest/gtest.h>

Go to the source code of this file.

Functions
	TEST (wnaf, GetWnafBitsConstLimbBoundary)
	TEST (wnaf, WnafPowerOfTwo)
	TEST (wnaf, WnafZero)
	TEST (wnaf, WnafTwoBitWindow)
	TEST (wnaf, WnafFixed)
	TEST (wnaf, WnafFixedSimpleLo)
	TEST (wnaf, WnafFixedSimpleHi)
	TEST (wnaf, WnafFixedWithEndoSplit)

Function Documentation

TEST() [1/8]

TEST	(	wnaf	,
		GetWnafBitsConstLimbBoundary
	)

Definition at line 57 of file wnaf.test.cpp.

TEST() [2/8]

TEST	(	wnaf	,
		WnafFixed
	)

Definition at line 170 of file wnaf.test.cpp.

TEST() [3/8]

TEST	(	wnaf	,
		WnafFixedSimpleHi
	)

Definition at line 197 of file wnaf.test.cpp.

TEST() [4/8]

TEST	(	wnaf	,
		WnafFixedSimpleLo
	)

Definition at line 184 of file wnaf.test.cpp.

TEST() [5/8]

TEST	(	wnaf	,
		WnafFixedWithEndoSplit
	)

Definition at line 210 of file wnaf.test.cpp.

TEST() [6/8]

TEST	(	wnaf	,
		WnafPowerOfTwo
	)

Definition at line 78 of file wnaf.test.cpp.

TEST() [7/8]

TEST	(	wnaf	,
		WnafTwoBitWindow
	)

We compute the 2-bit windowed NAF form of input.

For representing even numbers, we define a skew:

   / false   if input is odd

skew = | \ true if input is even

The i-th quad value is defined as:

   / -(2b + 1)   if sign = 1

q[i] = | \ (2b + 1) if sign = 0

where sign = ((wnaf[i] >> 31) == 0) and b = (wnaf[i] & 1). We can compute back the original number from the quads as:

127

\ R = -skew + | 4^{127 - i} . q[i].

/

i=0

Definition at line 116 of file wnaf.test.cpp.

TEST() [8/8]

TEST	(	wnaf	,
		WnafZero
	)

Definition at line 101 of file wnaf.test.cpp.