Re: about the big number xor
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 very much, i use cscope and find the BN_GF2m_add , 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 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 http://www.openssl.org >> User Support Mailing List openssl-us...@openssl.org >> Automated List Manager majord...@openssl.org >> > __ > OpenSSL Project http://www.openssl.org > User Support Mailing List openssl-us...@openssl.org > Automated List Manager majord...@openssl.org > __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord...@openssl.org
Re: about the big number xor
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 very much, i use cscope and find the BN_GF2m_add , > 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. sorry, after read the code , i think i understand the note's meaning, when a or b are zero, the result r could be a or b. Because when a number xor zero , the result is the original number. >> Cheers, >> -- >> Mounir IDRASSI >> IDRIX >> http://www.idrix.fr >> >> jaze lee wrote: >>> 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 http://www.openssl.org >>> User Support Mailing List openssl-us...@openssl.org >>> Automated List Manager majord...@openssl.org >>> >> __ >> OpenSSL Project http://www.openssl.org >> User Support Mailing List openssl-us...@openssl.org >> Automated List Manager majord...@openssl.org >> > __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord...@openssl.org
Re: about the big number xor
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. Cheers, -- Mounir IDRASSI IDRIX http://www.idrix.fr jaze lee wrote: > 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 http://www.openssl.org > User Support Mailing Listopenssl-users@openssl.org > Automated List Manager majord...@openssl.org > __ OpenSSL Project http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord...@openssl.org
about the big number xor
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 http://www.openssl.org User Support Mailing Listopenssl-users@openssl.org Automated List Manager majord...@openssl.org
