Hello All
Great for all your help.
I am now able to get notebook.
Actually the problem was: my Work Offline mode was on so I could not start
things.
I unchecked the work offline mode and now things are working.
Thanks to everybody.
Wishes for happy new year.
Regards
Vijay
On Sun, Dec 26, 20
Hi
In order to completing my programming I need to have a random point of
the jacobian group of a hyper elliptic curve.
Is there any function in sage for my programming using? I know there
exist a such function in magma ,but I don't have access to magma.
Thanks
--
--
To post to this group, send e
We discussed this briefly on #sage-devel a couple weeks ago, though
the discussion died out and nobody got around to submitting a trac
ticket about it (probably because it's not really clear which way to
go on this...). Here's the log, which might answer some questions:
http://sage.pastebin.com/EBq
On Dec 30, 2010, at 12:56 PM, Volker Braun wrote:
> 5. Make a symlink /somewhere/in/PATH/sage -> $SAGE_ROOT/sage
>
> So if the user has ~/bin already in his path, then this could be done without
> administrative rights.
I think this is what install_scripts() does, but I could be wrong. Actuall
5. Make a symlink /somewhere/in/PATH/sage -> $SAGE_ROOT/sage
So if the user has ~/bin already in his path, then this could be done
without administrative rights.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+un
One may use the following approach in Sage but will not efficient for larger
e.
R. = PolynomialRing(QQ,3)
ideal = R.ideal([(1+x)^2-y, x^3-z])
list(ideal.elimination_ideal([x]).gens()),
e=3 here.
On 30 December 2010 15:51, Alasdair wrote:
> Can you provide the context for this question? Where do
On Monday, December 27, 2010 11:29:25 PM UTC+1, Johhannes wrote:
>
> now I need to get the following equatoin solved:
> v * r = 1 but the type of v * r == 1 is boolean,
>
What do you mean by boolean? You can use integer linear programming to get
a solution to that.
http://sagemath.org/d
Can you provide the context for this question? Where does it come up?
-Alasdair
On Dec 30, 9:01 pm, Santanu Sarkar
wrote:
> Let "N=pq" be RSA modulus with public key "e".
>
> given an instance (x^e mod N, z mod N) where "z" an take value either
> (1+x)^2 or any random value, "r" belonging to Z
Let "N=pq" be RSA modulus with public key "e".
given an instance (x^e mod N, z mod N) where "z" an take value either
(1+x)^2 or any random value, "r" belonging to Z_N, with probability 1/2,
what can be the known best algorithm to distinguish (x^e mod N, (1+x)^2 mod
N) from (x^e mod N, r) ?
--
T
Sorry I didn't see this--I wasn't on sage-support until now. I ran
across this thread while searching for something else.
On Nov 3, 12:04 am, Jason Grout wrote:
> On 11/2/10 5:17 PM, D.C. Ernst wrote:
>
> Yes, sagetex should work. You just have to make sure you call the
> actual Sage program fr
10 matches
Mail list logo
