Hello
As i understand it, polynomial support was added to OpenSSL by Suns ECC
library
It looks like both polynomials and GF(p) elements are represented by Bignum
structs.
While functions in crypto/bn/bn_gf2m.c seem to provide basic binary field
arithmetics,
I cant help but wonder, is there a
Hello
I recently discovered that openssl has a sort of database (called txt_db)
which looks like
its a disk-based hash table (like Berkeley DB).
It is used in CA to store certificates and stuff, so it should be quite
potent.
I would like to use it for my own purposes, The api are few, but they
Hello
as i understand, ecc code came to openssl from sun microsystems.
I would like to know,
1) what algorithms are used for reduction, inversion, multiplication in
GF(2^m) and GF(p)
2) what coordinates are used in EC point operation
3) what algo is used for EC scalar multilication?
Dear sirs
I am looking for a way to perform a set of heterogeneous operations, with
some parameters being BIGNUM and some just 32 bit integers.
for example, multiply a bignum by 2, increment a bignum by 1, find a result
of BIGNUM modulo 3, etc.
How can i do it, without initialising bignums to 2,
