mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2008-11-15, 09:42   #1
Greenk12
 
Oct 2008

11102 Posts
Default About random number (random seed) in Msieve

Hello!

I have question about Block Lanczos algorithm (Montgomery) :

As i know during run Block Lanczos algorithm - we select random a matrix Y (size nxN, N = 64), therefore we use this matrix to run Block Lanczos algorithm. So i want to ask:

Can we know matrix Y that we initialized is best to run Block Lanczos algorithm? (I mean: if we use matrix Y, we always run Block Lanczos algorithm success.) And oppose, can we know matrix Y is bad to run Block Lanczos algorithm? (if we use bad matrix Y, Block Lanczos algorithm can fail!).

Thank for your reading.
Greenk12 is offline   Reply With Quote
Old 2008-11-15, 13:56   #2
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3×1,163 Posts
Default

Block Lanczos only works with high probability, and the most that anyone has proved is that failure is extremely rare when the initial vector is chosen randomly. There is no way to tell when failure will happen, otherwise proving convergence would not be an interesting problem :)

More here
jasonp is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
random comments, random questions and thread titles made for Google jasong Lounge 46 2017-05-09 12:32
odds of random number being prime jasong jasong 32 2009-12-01 06:43
Odds that a random number is prime Number theory Homework Help 4 2009-08-28 22:04
Random number thread - poll 10metreh Factoring 13 2008-11-13 07:06
Odds of a prime number being random Orgasmic Troll Lounge 6 2007-08-11 04:09

All times are UTC. The time now is 01:52.

Mon Oct 26 01:52:33 UTC 2020 up 45 days, 23:03, 0 users, load averages: 1.71, 1.66, 1.63

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.