Hi All,

we are all used to test vectors for testing algorithms.

I was wondering if there is a set of test vectors for differing bit
lengths for a multi precision math library.

This would include results for such thins as adding, subtracting,
modula, exponents and the like to support a crypto library.

Do such vectors exist?

I can generate such things using CAS's - but was wondering if there
are standard test vector sets.

Thanks for any pointers.

~A

Obfuscated hidden numbers are hard to code. Here is a primary method
of hidden number coding. The output is a column of i,f,j index
numbers. 14 sets of three, from one to three.

All you have to do is place an array inside the for loop set and
initialize.

u[i][f][j]=

An equation is caused to exist. Certain I,F,J array elements are set!
While others are not.

U(1,2,3)= F(14)

Any old Function, F, can be placed there.

F(x)= 1/x 1...14

SO a hidden set is created.

This is the primary method of hidden key technique.

#include

main(){

unsigned char index1[1];
unsigned char index2[1];
unsigned char index3[1];
int i,f,j;

On Fri, 25 Jul 2008 15:45:25 +0000 (UTC), badgolferman wrote:

Kaminsky is the real deal, I had the pleasure of listening to him speak
at Defcon.

Here is some of his work with Tor

http://afs.eecs.harvard.edu/~goodell/blossom/tor-via-dns.html

Giuen Interpose & Outright Company

A New Generation Outright Company begun in 2008 the funding for a
battlefield data link that projected data onto a computer screen
inside for example vehicles and inside the tanks. A system mated up
with...