search for: prime

> I did some local testing and it seems that you are using a curve that is not acceptable for openssl as a server key. > > I tested with openssl s_server -cert ec-cert.pem -key ec-key.pem -port 5555 > > using cert generated with brainpool. Everything works if I use prime256v1 or secp521r1. This is a limitation in OpenSSL and not something we can really do anything about. > > Aki Tuomi > Open-Xchange Oy Which openssl version you are using? This end it is OpenSSL 1.1.0h. There are no issues creating private keys, issuing csr, signing certs with that particu...

...I am a beginner in R and try to build dlls (Win XP, MinGW, R 1.7.1). So far, I have managed to create and to use some dlls with C code which worked properly. Now I am stuck with a dll containing C++ code. I have included some part of the source code (of an implementation of a function to find all primes below a given numeric value -> its just an exercises to get familar with R/C++). >#include <vector> > >using namespace std; > >extern "C" { >#include <R.h> >#include <Rdefines.h> >} > >SEXP getPrimes(SEXP a) >{ >SEXP c; > //...

In message <Pine.LNX.4.30.0104031615270.8678-100000 at holly.crl.go.jp>, Tom Holro yd writes: >SRP has different requirements from Diffie-Hellman. In particular, >for SRP the generator must be primitive. It turns out that the "primes" >file contains only safe primes with primitive generators, and is thus >ideal for SRP, but so far in OpenSSH it has only been used for DH, >which doesn't require this. The primes file is used for the Diffie-Hellman group exchange. If you read the draft, you will see that safe p...

...14233 >> >> Hm, this is a sequence, but not an algorithm. It looks to me like it is >> not exhaustive, just a list of those integers 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 &g...

...---END CERTIFICATE----- > > > I did some local testing and it seems that you are using a curve that is not acceptable for openssl as a server key. I tested with openssl s_server -cert ec-cert.pem -key ec-key.pem -port 5555 using cert generated with brainpool. Everything works if I use prime256v1 or secp521r1. This is a limitation in OpenSSL and not something we can really do anything about. Aki Tuomi Open-Xchange Oy

...algorithms for doing that? > > OEIS A014233 Hm, this is a sequence, but not an algorithm. It looks to me like it is not exhaustive, just a list of those integers 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 wri...

...ockquote type="cite"> <div> I tested with openssl s_server -cert ec-cert.pem -key ec-key.pem -port 5555 </div> </blockquote> <blockquote type="cite"> <div> using cert generated with brainpool. Everything works if I use prime256v1 or secp521r1. This is a limitation in OpenSSL and not something we can really do anything about. </div> </blockquote> <blockquote type="cite"> <div> Aki Tuomi </div> <div> Open-Xchange Oy </div> </blo...

Hi R People: I am looking at the Braun/Murdoch book, " A First Course in Statistical Programming in R", and I have a question about a function there. It's on page 52, Example 4.5; the sieve of Erastosthenes. There is a line: primes <- c() Is there a difference between using that and primes <- NULL please? When you put in primes <- c(), primes comes back as NULL. Is one more efficient or is this just a matter of programming style, please? Thanks in advance, Sincerely, Erin -- Erin Hodgess Associate Professor D...

Hi everyone, I have a very quick question: Is there a ready-made function in R or any R packages to find the prime factorization of an integer? -- View this message in context: http://r.789695.n4.nabble.com/Prime-Factorization-tp2548877p2548877.html Sent from the R help mailing list archive at Nabble.com.

...venient experience for being taken outside. So, it is not a professional media player that can fit all your playing requirements. And we should figure out that tablet PCs can playback most of videos except those HD videos encoded by H.264 codec. Since the Asus will release the Eee Pad Transformer 2(Prime), more and more tablet lovers care about whether Transformer Prime supports play Blu-ray movies or not. In fact, Transformer Prime is the new version of Transformer series while Blu-ray movies are encoded by HD video codec. So, if you want to watch Blu-ray movies through Transformer Prime, you al...

I need to create a function to find all the prime numbers in an array. Can anyone point me in the right direction? Thank you. AJ -- View this message in context: http://www.nabble.com/Function-to-find-prime-numbers-tp25868633p25868633.html Sent from the R help mailing list archive at Nabble.com.

On 25 September 2017 at 02:32, Mark D. Baushke <mdb at juniper.net> wrote: > [+CC Loganaden Velvindron <logan at hackers.mu>] primary author of > the RFC 4419 refresh draft. https://datatracker.ietf.org/doc/draft-lvelvindron-curdle-dh-group-exchange/ ? Tangent: has any consideration been given to increasing the maximum allowed beyond 8192 bits (which is below the current NIST

On Thu, 28 May 2015, Hubert Kario wrote: > > If this is the only attack you're trying to address, and you've > > already limited yourself to safe primes, then NUMS properties don't > > really add anything. The NUMS approach is there are to try to avoid > > the possibility of other, unknown cryptanalytic attacks against some > > infrequent type of group, so that the entity who defines the group > > can't force you in...

Hello, does LLVM already have a Random Number Generator built into it's library somewhere? I know code generation is suppose to be deterministic, but when producing a random number can be deterministic if the random number generator is also deterministic. - Thanks - Jeff Kunkel

Hi, I know this question has been asked before but I have not seen an answer pertaining to repeated measures anovas. I got a simple data set with two factors: block (3 levels) and prime (2 levels). The dataset (expData) are stuctured so one column (block) states which block a trial is in and one column (prime) states which prime was used in the trial, another column (RT) states reation time for that trial and finally a column (subject) states subject number (there are 10 trials in...

...If someone wants to take it out and add it to the llvm library, it's a simple Linear Congruential Generator, but here it is: typedef struct random_number_gen { unsigned a, c, seed, m; random_number_gen( unsigned seed, unsigned modulo ) : seed(seed), m(modulo) { unsigned primes[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 }; a = 1 + primes[ seed % ( sizeof(primes)/sizeof(primes[0]) ) ]; c = primes[ modulo % ( sizeof(primes)/sizeof(primes[0]) ) ]; } unsigned rand() { return seed = (a*seed + c) % m; } } random_number_gen; -Thanks -J...

https://bugzilla.mindrot.org/show_bug.cgi?id=2559 Bug ID: 2559 Summary: Warnings from reading moduli file, refer to primes file Product: Portable OpenSSH Version: 7.2p1 Hardware: Other OS: Linux Status: NEW Severity: enhancement Priority: P5 Component: sshd Assignee: unassigned-bugs at mindrot.org...

I want to write something like (LaTeX style) b_{norm}=\frac{F\prime(0)}{R\prime(0)} how do I add the "prime" (first derivative) to a R-plot? The help of "plotmath" just talks about "partialdiff". Can you complete this command? text( 30,0.05,labels=expression(b[plain("norm")]==frac(F(0),R(0))) ) Thanks, Thomas

Looking for a recommended package that handles prime number computations. Tried the following unsuccessfully: primeFactors() in the R.basic package failed to install. primes() and primlist are broken in Schoolmath pkg on CRAN. My analysis can be found here http://j.mp/9BNI9q Not sure what the procedure is for getting things fixed, so I've cross...

Looking for a recommended package that handles prime number computations. Tried the following unsuccessfully: primeFactors() in the R.basic package failed to install. primes() and primlist are broken in Schoolmath pkg on CRAN. My analysis can be found here http://j.mp/9BNI9q Not sure what the procedure is for getting things fixed, so I've cross...