mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 35
Search took 0.01 seconds.
Search: Posts Made By: Washuu
Forum: Tales From the Crypt(o) 2020-11-11, 13:54
Replies: 0
Views: 269
Posted By Washuu
Perfect method to do Indistinguishability Obfuscation has been found!

https://www.quantamagazine.org/computer-scientists-achieve-crown-jewel-of-cryptography-20201110/
Forum: mersennewiki 2015-12-30, 14:59
Replies: 169
Views: 35,066
Posted By Washuu
Good day, I'd like to request write access...

Good day,

I'd like to request write access to the wiki page. I'd like to factor some home primes.
Forum: Msieve 2008-01-26, 00:21
Replies: 465
Views: 45,145
Posted By Washuu
msieve win32 binary size

Hi,

msieve windows binary v. 1.30 is 279 KB long, msieve 1.32 is 560 KB long. What caused 100% increase of size? Compiler options, new features, or some debug info?
Forum: Hardware 2006-04-25, 22:54
Replies: 6
Views: 2,362
Posted By Washuu
Question What server...?

Hi,

At last! I managed to convice my boss for buying a new server. I got approx. 5K$ for this (I live in Poland, where servers are a little bit cheaper than in USA), and completely free hand. I...
Forum: Factoring 2005-08-09, 00:09
Replies: 10
Views: 1,375
Posted By Washuu
It was for sure >C115, something about C120,...

It was for sure >C115, something about C120, maybe C119 or C121, don't quite remember now, hovewer when we calculated the time we used approx. data for C120 (and calculated that whole factorization...
Forum: Factoring 2005-08-08, 18:30
Replies: 10
Views: 1,375
Posted By Washuu
Hey, you are the master of poly selection! You...

Hey, you are the master of poly selection! You tell me! :razz: :)

OK, seriously: I was only thinking about rather simple cases (at least in the beginning), for numbers like k*x^p+c. The program...
Forum: Factoring 2005-08-08, 11:59
Replies: 10
Views: 1,375
Posted By Washuu
But there is always a chance (small, I know) that...

But there is always a chance (small, I know) that general number is close to some multiple of power of some number. Smart program could check this in seconds, and a prize (however not very likely) is...
Forum: Factoring 2005-08-07, 19:02
Replies: 10
Views: 1,375
Posted By Washuu
is GGNFS checking for SNFS number?

Hi, quick questions for those familiar with polynomial selection tool in new GGNFS suite:

let's assume we have a general number N, that can be represented as SNFS k*x^p+c (example:...
Forum: Hardware 2005-07-31, 08:53
Replies: 12
Views: 2,275
Posted By Washuu
Altera

I am also interested in FPGA programming, however I started studying it only half year ago.

Also, because of my University's agreements with Altera, I mostly programmed FPGAs using AHDL and MAX...
Forum: Factoring 2005-07-23, 21:38
Replies: 83
Views: 7,554
Posted By Washuu
Question Is it normal?

I started work on M131072 with B1=1000000, B2=default, just for curiosity. After a few hours I noticed, that PRIME95 is working on curve #7, and...

[Jul 23 23:28] At prime 34903909. Time thusfar...
Forum: Math 2005-06-14, 15:58
Replies: 12
Views: 890
Posted By Washuu
Yup, but only the main idea. Okay, so push...

Yup, but only the main idea.

Okay, so push me a little further and tell me about using polynomials in sieves, if you have a few minutes :)

I have read that sieve of Eratosthenes is better when...
Forum: Math 2005-06-14, 11:06
Replies: 12
Views: 890
Posted By Washuu
Thumbs up Done!

Hi.

I haven't got Crandall&Pomerance book (maybe someone could point me the place in priv message), but I have managed to do my task. This was very simple idea, and rather slow and ugly...
Forum: Math 2005-06-11, 19:55
Replies: 12
Views: 890
Posted By Washuu
Question Smoothness test

I have a number, say 50 digits long. It is not any special form, and I know its factorization.

I want to find all numbers in my number neibourhood (say from n-10000 to n+10000) which are smooth...
Forum: Hardware 2005-06-01, 22:58
Replies: 9
Views: 1,336
Posted By Washuu
My question was general, not in the meaning of...

My question was general, not in the meaning of GIMPS. (I said "A program, not THE program"). I know that computing the FFT's is very hard to paralellize. What would be most paying IMO, is...
Forum: Hardware 2005-06-01, 17:41
Replies: 9
Views: 1,336
Posted By Washuu
Aloso google for such terms as: "Beowulf" ...

Aloso google for such terms as:

"Beowulf"
"Cluster of Workstations"
"OpenMP"
"MPICH" - this one works for Windows NT!
"LAM"

BTW: Is someone here that can REALLY re-code a program to use...
Forum: Factoring 2005-05-27, 22:01
Replies: 33
Views: 2,613
Posted By Washuu
GGNFS problems...

I just downloaded cygwin on my Sempron machine, rebuilded GMP, and compiled GNFS from scratch (default options for Athlon, compilation went smoothly except a few warnings about pointers). When I...
Forum: Factoring 2005-05-25, 19:26
Replies: 33
Views: 2,613
Posted By Washuu
Composites needed :)

Hi,

I'm looking for composite numbers that are to be factored, but not greater than C125 (yet). Cunningham tables seem to be cleared out of numbers this size... which projects/webpages/another...
Forum: 15k Search 2005-05-23, 09:54
Replies: 13
Views: 6,108
Posted By Washuu
bad luck...

I have tested k=5865 from N=200K to N=300K, on a few machines.

It took over one week with LLR.exe, I sieved to 77billions by newpgen.exe earlier.

Only one prime found, 5865*2^261351-1. I...
Forum: Math 2005-05-13, 18:51
Replies: 3
Views: 703
Posted By Washuu
Found it. A 15 minutes later. Grrrr... ...

Found it. A 15 minutes later. Grrrr...

There should be ln instead of log. So silly error, I couldn't hit the idea earlier...

now cosh(...) = 1002978273411373057.0000000000000000000000000\...
Forum: Math 2005-05-13, 18:38
Replies: 3
Views: 703
Posted By Washuu
correct me.

From http://primes.utm.edu/prove/prove3_2.html:



I tried to check this with small number. I choose p=2^7-1=127. I got my best calculator and calculated:

sqrt(3)=1,73205080756888...
Forum: Math 2005-05-13, 17:18
Replies: 1
Views: 1,001
Posted By Washuu
Lightbulb Sure. First of all - take look at this page (but...

Sure. First of all - take look at this page (but whole site is worth of reading): http://primes.utm.edu/prove/index.html.

The theorem used in testing number as Probable Prime is Fermat Little...
Forum: Programming 2005-04-15, 17:40
Replies: 26
Views: 2,812
Posted By Washuu
back to the topic

I have just found this thread, and I wonder why no one posted simplest (people counts like that!) and IMO most elegant way to calculate Fibonacci numbers:

pseudo-C-code:

const MAX=1000;
long...
Forum: 15k Search 2005-04-15, 15:02
Replies: 5
Views: 1,928
Posted By Washuu
EDIT:...

EDIT: length=log10(b)*n+log10(k)=n*log10(b)+log10(k) of course. I should think twice before "submit" button... :redface:
Forum: 15k Search 2005-04-15, 11:00
Replies: 5
Views: 1,928
Posted By Washuu
IMO you can post your primes to "top5000" list...

IMO you can post your primes to "top5000" list only if your primes are at least 56000 digits long, unless they have some "special form". "Special form" is NOT k*b^n+c, but I may be wrong...
...
Forum: Factoring 2005-04-13, 10:52
Replies: 11
Views: 1,205
Posted By Washuu
hmmm, but take for example number...

hmmm, but take for example number 394875391875093847503924230984230947133. Mentioned applet knows in less than second that this is composite, and 39487539187509384750392423098423094713333333333333 is...
Showing results 1 to 25 of 35

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

Sun Dec 6 02:01:01 UTC 2020 up 2 days, 22:12, 0 users, load averages: 2.34, 2.65, 2.70

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.