2009/10/14 Reid Thompson jreidthomp...@nc.rr.com:
On Tue, 2009-10-13 at 08:58 +0800, jaze lee wrote:
hello guys,
recently i use openssl to implement a identify scheme, i need the
hash function. But the sha1 can not meet my needs，
the message digest i want are 200 bits or more
jaze-lee
__
OpenSSL Project http://www.openssl.org
User Support Mailing Listopenssl-users@openssl.org
Automated List Manager majord
I want to implement xor function of large number . I do not know
whether the similar function is already been implemented. If so, where
i can find it . And if not i have to try , thank you !
__
OpenSSL Project
list
__
OpenSSL Project http://www.openssl.org
User Support Mailing Listopenssl-users@openssl.org
Automated List Manager majord...@openssl.org
2009/9/14 jaze lee jaze...@gmail.com:
2009/9/14 Mounir IDRASSI mounir.idra...@idrix.net:
Hi,
There is no explicit function for this but you can use the function
BN_GF2m_add to perform the XOR of two BIGNUMs : for GF2m polynomials,
the addition is a simple bitwise XOR.
Thank you very much, i
,
the note is Add polynomials a and b and store result in r; r could
be a or b, a and b could be equeal;
r is the bitwise XOR of a and b .
i want to know when the r is the xor of a and b.
Cheers,
--
Mounir IDRASSI
IDRIX
http://www.idrix.fr
jaze lee wrote:
I want to implement xor function
hello,
how we change the data we want to encode to the point in the
ecliptic ? thank you
__
OpenSSL Project http://www.openssl.org
User Support Mailing List
2009/6/7 Victor Duchovni victor.ducho...@morganstanley.com:
On Sun, Jun 07, 2009 at 09:51:14AM +0800, jaze lee wrote:
The problem is we can not find the function yet ? or some other ways
to judge a big integer whether it's a prime. Is it so-called
mathematics problem that many cipher based
2009/6/6 Rustam Rakhimov rusyas...@gmail.com:
So if you are so brave try the example given before.
Than you will feel reality.
may be you are wright, i try , but i can not get the result.
if a integer with m bits and another integer with n bits, if the
multiple , there product has m+n bits or
2009/6/6 Michael S. Zick open...@morethan.org:
On Sat June 6 2009, jaze lee wrote:
i still not understand the problem. although i don''t get the result.
Q1: Why is this problem hard - as in: computationally hard ?
A1: There are two many number trials (computations) required
hello,
when i read some books about cryptography, it always go that the
cryptography is based on the difficult math problem, for example big
integer decomposition,
i don't understand it, for if we know that n = p*q , p, q are prime ,
why it's difficult to get p and q ? i think ,if we know
2009/6/6 David Schwartz dav...@webmaster.com:
hello,
when i read some books about cryptography, it always go that the
cryptography is based on the difficult math problem, for example big
integer decomposition,
i don't understand it, for if we know that n = p*q , p, q are prime ,
why
hello,
#include openssl/bio.h
2 int main() {
3 BIO * b;
4char buf[100] = hello world \n;
5 b = BIO_new(BIO_s_file());
6 BIO_set_fp(b, stdout, BIO_NOCLOSE);
7 BIO_write(b, buf, sizeof(buf));
8 return 0;
9 }
after compile , and run, i can see the hello
hello,
If there is a large file, I want to use BIO_read to read it
to buff[4096] in a loop, but i found it start from the second loop,
BIO_read from the file begining. I use BIO_seek to solve it.
But it not work. Is there any good suggestion ? Thank you
14 matches
Mail list logo
