Re: about the sha1

2009-10-14 Thread jaze lee
2009/10/14 Reid Thompson : > 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

about the sha1

2009-10-12 Thread jaze lee
jaze-lee __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord

Re: about the big number xor

2009-09-13 Thread jaze lee
e 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 wro

Re: about the big number xor

2009-09-13 Thread jaze lee
2009/9/14 jaze lee : > 2009/9/14 Mounir IDRASSI : >> 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

[no subject]

2009-09-13 Thread jaze lee
list __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord...@openssl.org

about the big number xor

2009-09-13 Thread jaze lee
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

about the ec_group_st struct

2009-06-18 Thread jaze lee
hello, I find the structure of EC_GROUP, and there is a variable i don't understand. it is the variable order, what 's the role of the order . who knows ? Thank u. struct ec_group_st { 36 const EC_METHOD *meth; 37 EC_POINT *generator

trace the ecdsa_do_sign

2009-06-17 Thread jaze lee
hello, when i traced ecdsa_do_sign, i can not find the definition of ECDSA_SIG_new(), anyone know where it is ? thank you __ OpenSSL Project http://www.openssl.org User Support Mailing List

the point in elliptic curve

2009-06-15 Thread jaze lee
hello, If i want to use elliptic curve encryption algorithm, i have to express my data into the point in the curve, Is there some good methods do this job well ? Thank u. __ OpenSSL Project ht

about the eccc encryption algorithm

2009-06-15 Thread jaze lee
Hello, Is there a function to implement the ecc encryption ? not ecc signature. Thank you . __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@op

about the ecc point

2009-06-11 Thread jaze lee
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 Listopenssl-users@opens

Re: about the integer decomposition

2009-06-07 Thread jaze lee
2009/6/7 Victor Duchovni : > 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 b

Re: about the integer decomposition

2009-06-06 Thread jaze lee
2009/6/6 Michael S. Zick : > 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

Re: about the integer decomposition

2009-06-06 Thread jaze lee
2009/6/6 Rustam Rakhimov : > 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 m+n-1 bits. 2489114

Re: about the integer decomposition

2009-06-05 Thread jaze lee
2009/6/6 David Schwartz : > >> 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 diff

about the integer decomposition

2009-06-05 Thread jaze lee
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 the

bio_write

2009-05-28 Thread jaze lee
hello, #include 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 world but if

[no subject]

2009-05-27 Thread jaze lee
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 _