search for: mpz

On Mon, 18 Jan 1999 <Stephan.Hendl@mpz-brandenburg.nubb.dfn.de> wrote: >hi anybody, >I just upgraded to the final release 2.0.0 and got some problems. >I the [homes]-section I have to set "writable = Yes" in order to get >write access to my home-directory. Unfortunately this allows me to >delete a file tha...

...Smallest odd number for which Miller-Rabin >> primality test on bases <= n-th prime does not reveal compositeness"). >> >> Taking the final integer in that sequence (a(11)) fails even the default >> >> 25-round M-R test in gmp: >> >>> k = gmpy2.mpz(3825123056546413051) >> >>> gmpy2.is_prime(k) >> >> False > > I'm quite sure that this means that gmpy doesn't use pure M-R with randomly > selected witnesses. https://gmplib.org/manual/Prime-Testing-Algorithm.html#Prime-Testing-Algorithm suggests is...

Hey All, I have a dataset(dat1) like this: ObsNumber ID Weight 1 0001 12 2 0001 13 3 0001 14 4 0002 16 5 0002 17 And another dataset(dat2) like this: ID Height 0001 3.2 0001 2.6 0001

...type filter hook prerouting priority -50 } } # dump new state list ruleset $ nft -c -f ./nft.ruleset table inet filter { chain prerouting { Segmentation fault (core dumped) Backtrace: Program terminated with signal SIGSEGV, Segmentation fault. #0 __gmpz_export (data=0x7ffc919cdd1c, countp=0x7ffc919cdc60, order=-1, size=4, endian=0, nail=0, z=0x50) at ../../gmp-6.1.2/mpz/export.c:66 66 zsize = SIZ(z); (gdb) bt #0 __gmpz_export (data=0x7ffc919cdd1c, countp=0x7ffc919cdc60, order=-1, size=4, endian=0, nail=0, z=0x50) at ../../gmp-6.1.2/m...

...rs which are known to have the stated property ("Smallest odd number for which Miller-Rabin primality test on bases <= n-th prime does not reveal compositeness"). Taking the final integer in that sequence (a(11)) fails even the default 25-round M-R test in gmp: >>> k = gmpy2.mpz(3825123056546413051) >>> gmpy2.is_prime(k) False >>> Indeed, the arxiv suggests that in 2012 people were still writing proofs about a(11) for this sequence: http://arxiv.org/abs/1207.0063 but i see no evidence that an algorithm for generating a(n) where n is arbitrarily large...

On Tue 2015-05-26 12:57:05 -0400, Hubert Kario wrote: > creating composites that will pass even 100000 rounds of Miller-Rabin is > relatively simple.... > (assuming the values for M-R tests are picked randomly) Can you point me to the algorithms for doing that? This would suggest that we really do want primality proofs (and a good way to verify them). Do those algorithms hold for

On Fri 2015-05-22 00:06:29 -0400, Darren Tucker wrote: > On Thu, May 21, 2015 at 11:26 PM, Matthew Vernon <matthew at debian.org> wrote: >> >> You will be aware of https://weakdh.org/ by now, I presume; the >> take-home seems to be that 1024-bit DH primes might well be too weak. >> I'm wondering what (if anything!) you propose to do about this issue, >>

...led: %s\n", -+ error("%s:%d: GNU MP assertion failed: %s\n", - filename, linenum, expr); - } - --void __attribute__ ((regparm(0))) abort(void) --{ -- panic(KERN_CRIT TPM_MODULE_NAME "GNU MP abort() was called\n"); --} -- - /* overwrite GNU MP random functions (used by mpz/millerrabin.c) */ - - void __attribute__ ((regparm(0))) gmp_randinit(gmp_randstate_t rstate, -@@ -77,20 +73,19 @@ void __attribute__ ((regparm(0))) mpz_ur - - void __attribute__ ((regparm(0))) *kernel_allocate(size_t size) - { -- void *ret = (void*)kmalloc(size, GFP_KERNEL); -- if (!ret) panic(K...

...rsl47ikZYhmB5479ZhhKWocuWzKNVUEVRoRb2a/rROr8WZ/Nnt0B+sM4f0fRzpjzL lLeasguyz4cKWjijq07TWZsW1utXd8XCbXVFhaw3yVHrr+10FBVSryMJYhIkPd3f3cvSK5kp8PRw eS8nmwtT1LP8dWE904+qaEbkh9sX602zW8J12T5fpKhQZ7Ud/kU6+Wt0d9A0oVqzG12t1a1mN9pS HbOhTVpv4WDsgbiHFrUFnYv9i9sXtOiiHW2E9ZQg+q3T0795NuNfWTSeWtuy8cul2SIWzliqSeNY bKOmPza75Ut1s32yhUgEbaAuz69vi9Wj6wewUg1zNfTGN0RadLYBXWpyJnJWifl1+sNS07ZM0+3+ Gn9XbFkbliYrptOcO3x9WVmhvcZpygprseYWv0+vyvZH2utyekdTbM4d/ZkhLXNkSVFhrycl4dje ZPew4HR9WeiE0xNlpmSaS6lhzmXPMjki/0w9hIjq0DCSFj/mNFWSzqkU65iKBcATYailL8aKLNXt tW0xT7nUY4pMt+R7/FrsY0IE+M/9ZaSmfVij5ns+Jlko4+RyqOms/ZKsB4N6QYEMEWst1hRjrDT...

...TVU6I+57;??Em}WV-0-f3x4Hq<Q>rKDs0wx^?Nr z&@gs+`%XcgX?v7b`3e%Y{DSfzHttZJ at JI`Wd$H)?T=*&qhFAG&3L at Z+FD@Cpk%CqQ z{p2B{02?}({NVz)F$IxeL0R39f@?Z;{=*HO+EZc2UGiOmEE{&q-#CTMFQZ2Ext%V) zoR;YFn~fn3gO%d>fU|es0sV_SV!L;k(E<I^aXw3UEXmM!nB5dH?NKc;%>5CYE@|%) zE|)xe^{pfw3~6lS?}uQ+!mPZa1c4i8vgpU|X12 at NrCTTn-$`neb)V#_4Z_OT_kc!( zd4+$7FO1DZT&{&3;=XwZdfhU?DZc3W!ljAXjof>*jJDtC7pv%nSEFB-;%;dZuW6gb zWhCD+HvP3iok%+!>gJDRCf>zBuwgx1<*$s`C)W0HFZ41if;dcyWl=uVI^?E`1q;2a z_Q`wg470W3*o97t{Y1=sj^M{M_JKFnAC3zXJt+5OSf6oXPHBpzmevo6pcygCK!s4K z*ydAxII78~xpM2r*;ih<(6V5lg88AD...

hi anybody, I just upgraded to the final release 2.0.0 and got some problems. I the [homes]-section I have to set "writable = Yes" in order to get write access to my home-directory. Unfortunately this allows me to delete a file that was created originally by root. But this is not actually what I want. In 1.9.18p10 the unix file permissions were at the top level and I couldn't do