I'll toss in my 2 cents and perhaps say something either stupid or obvious.
That is that if you have a number of say 1024 bits then you can compute the
cube root in 1024/3 operations where each operation in z^3. I do not know why
you need the number and I do not know if this is an acceptable c
On Sat, Aug 06, 2005 at 05:36:52PM -0700, Anirban Banerjee wrote:
> Can someone please let me have a pointer to how I may obtain a cube root of
> a BIGNUM
Wrong question. BIGNUMs are for high precision *integer* arithmetic,
often in a finite ring (e.g. Z/pqZ). In this context cube roots either
Hi everyone,
Can someone please let me have a pointer to how I may obtain a cube root of a BIGNUM, I looked up the SSLeay pages and the Openssl ducs but could not find any function that allows you to take a cube root of a BN. I've tried out BN_reciprocal() to get the value for 1/3
Anirban Banerjee wrote:
> Hi everyone,
> Can someone please let me have a pointer to how I may obtain a cube root of
> a BIGNUM,
Hopefully others will have better ideas but one possibility is to
use Newton's formula. I'm not sure what it is with cube roots but
it's probably something like:
I am attempting to use xsupplicant to connect my fedora 4 laptop to a Open
/ static wep / eap-tls enabled cisco wireless network with Cisco ACS
radius server and a Microsoft CA, everything works fine if I just use wep
and avoid EAP-TLS.
My xsupplicant configuration files seems to be correct, h
