Displaying 20 results from an estimated 1725 matches for "priming".
Did you mean:
pricing
2018 Jul 30
0
2.3.2.1 - EC keys suppport?
> 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.
>
>
2003 Nov 16
2
Error when calling a dll procedure
Dear experts,
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
2001 Apr 03
2
the "primes" file
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
2015 May 27
3
Weak DH primes and openssh
On Wed 2015-05-27 05:23:41 -0400, Hubert Kario wrote:
> On Tuesday 26 May 2015 15:10:01 Daniel Kahn Gillmor wrote:
>> On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote:
>> > 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
2018 Jul 30
3
2.3.2.1 - EC keys suppport?
> On 30 July 2018 at 20:37 ????? <vtol at gmx.net> wrote:
>
>
>
> >>>>>>> facing [ no shared cipher ] error with EC private keys.
> >>>>>> the client connecting to your instance has to support ecdsa
> >>>>>>
> >>>>>>
> >>>>> It does - Thunderbird 60.0b10 (64-bit)
>
2015 May 26
8
Weak DH primes and openssh
On Tue 2015-05-26 14:02:07 -0400, Hubert Kario wrote:
> On Tuesday 26 May 2015 13:43:13 Daniel Kahn Gillmor wrote:
>> 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
2018 Jul 30
2
2.3.2.1 - EC keys suppport?
<!doctype html>
<html>
<head>
<meta charset="UTF-8">
</head>
<body>
<div>
<br>
</div>
<blockquote type="cite">
<div>
On 30 July 2018 at 21:00 ѽ҉ᶬḳ℠ <
<a href="mailto:vtol@gmx.net">vtol@gmx.net</a>> wrote:
</div>
<div>
<br>
2008 Oct 08
4
question from Braun/Murdoch book
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
2010 Sep 21
1
Prime Factorization
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.
2011 Nov 16
0
Rip Blu-ray to Transformer Prime-Mac Blu-ray to Transformer
There are many people complaining that tablet PCs perform not so satisfactory when they are used to play videos. Actually, at first, tablet PC is developed as a mobile small PC that offers more convenient 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
2009 Oct 13
3
Function to find prime numbers
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.
2017 Sep 25
4
DH Group Exchange Fallback
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
2015 May 28
2
Weak DH primes and openssh
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,
2010 Oct 09
3
[LLVMdev] [LLVMDev] Does LLVM have a random number generator?
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
2013 Feb 20
1
type 3 aov for repeated measures
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
2010 Oct 09
0
[LLVMdev] [LLVMDev] Does LLVM have a random number generator?
I am plugging this into my code. 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 };
2016 Mar 30
6
[Bug 2559] New: Warnings from reading moduli file, refer to primes file
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
2007 Jan 10
2
prime in expression in plot
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
2010 Jun 14
3
Prime Numbers Pkgs - Schoolmath is broken
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-posted to r-dev as well.
--njg
2010 Jun 14
3
Prime Numbers Pkgs - Schoolmath is broken
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-posted to r-dev as well.
--njg