similar to: The length of an RSA signature sent during the handshake

Hi, Has anybody produced diffs for openssh-2.3.0p1 for the rsa keyexchange problem that Core-SDI described ? ( I noticed that fix is already in openbsd tree ). -Jarno -- Jarno Huuskonen - System Administrator | Jarno.Huuskonen at uku.fi University of Kuopio - Computer Center | Work: +358 17 162822 PO BOX 1627, 70211 Kuopio, Finland | Mobile: +358 40 5388169

Hi, OpenSSH 6.9 is almost ready for release, so we would appreciate testing on as many platforms and systems as possible. This release contains some substantial new features and a number of bugfixes. Snapshot releases for portable OpenSSH are available from http://www.mindrot.org/openssh_snap/ The OpenBSD version is available in CVS HEAD: http://www.openbsd.org/anoncvs.html Portable OpenSSH is

Hi (If you're wondering, this is a Project Euler question :)) If I wanted to calculate the sum of the digits in the decimal representation of 2^1000, what would be a good way to go about that? I've tried the following methods: # Calculate the sum of digits in the decimal representation of 2^n # Only works for smaller values of n bsum <- function(n) { s <- 0 e <-

On 01/21/10 20:42, Jan Sjodin wrote: >>> Imo, a loop is simply a special kind of region, so a "filter" is perhaps the way to >>> go if you are interested in loops. Regions containing loops will have to be inspected >>> using the PST. >> >> Except loops that have multiple exits. they are not necessarily (single >> entry single exit) region, if

In the source code of openssh(my source code is 6.0 for Openbsd?? The content below is Rsa.h #ifndef RSA_H #define RSA_H #include <openssl/bn.h> #include <openssl/rsa.h> void rsa_public_encrypt(BIGNUM *, BIGNUM *, RSA *); int rsa_private_decrypt(BIGNUM *, BIGNUM *, RSA *); void rsa_generate_additional_parameters(RSA *); #endif /* RSA_H */ Question:

Hi. In testing my SSH 2 server implementation (Dropbear), I've come across certain RSA hostkeys which fail for use with PuTTY as a client. Converting the keys for use with OpenSSH they also fail with PuTTY, which leads me to wonder whether they are valid keys or not. A sample key is attached, the important point to note is that the modulus (n) value doesn't have a multiple-of-8 number of

I'm trying to do a modulus operator in R-1.2.2 on Windows -- specific version: R : Copyright 2001, The R Development Core Team Version 1.2.2 Patched (2001-03-22) Here's what the R language manual says: "R contains a number of operators. They are listed in the table below. [snip] % Modulus, binary" Here's what happens on the R console: > records <- 100000 >

Hi all. We are getting our first PRI line to use with Asterisk and one of the technical specifications is about framing, structured or unstructured. The main difference about them is almost clear for me: http://ckp.made-it.com/g704.html says: "G.704 is the framing specification for G.703. A carrier can 'steal' a 64kbps time slot (TS0) from a 2.048 Mbps line and use this to

Dear R Helpers, I am trying to extract the modulus from divisions by a sequence of fractions. I noticed that %% seems to behave inconsistently (to my untutored eye), thus: > 0.1%%0.1 [1] 0 > 0.2%%0.1 [1] 0 > 0.3%%0.1 [1] 0.1 > 0.4%%0.1 [1] 0 > 0.5%%0.1 [1] 0.1 > 0.6%%0.1 [1] 0.1 > 0.7%%0.1 [1] 0.1 > 0.8%%0.1 [1] 0 > 0.9%%0.1 The modulus for 0.1, 0.2, 0.4 and 0.8 is

I am a statistician and I come up to an interesting problem in cryptography. I would like to use R since there are some statistical procedures that I need to use. However, I run into a problem when using the modulus operator %%. I am using R 2.2.1 and when I calculate modulus for large numbers (that I need with my problem) R gives me warnings. For instance if one does: a=1:40; 8^a %% 41 one

Dear all, Is it possible to incorporate a nested design in GEE? I have measurements on trees that where measured in two years. The trees are nested in plots. Each plot contains 24 trees. The number of plots is 72. Hence we would expect 2 * 24 * 72 = 3456 data points. A few are missing, so we end up wih 3431 data points. This is what I have tried until now. #assuming independence between trees

Hi folks, This applies to src/share/man/man5/moduli.5 in the OpenBSD source tree, and doesn't seem to apply to the portable OpenSSH, so I've sent this change here instead of via Bugzilla. The wording of moduli(5) implies that sshd puts more thought about which modulus it selects than it really does. The following patch corrects this. Simon. -- Simon Burge

Hi, is there any chance to make SSH_RSA_MINIMUM_MODULUS_SIZE configurable? I keep receiving these messages: ssh_rsa_verify: RSA modulus too small: 512 < minimum 768 bits key_verify failed for server_host_key And it's quite a hassle to recompile each time I need to use it (there are still devices where you can't fix it easily). Thanks Michal

suppose I have following complex number : a = -0.0475983+0.5364486i This number I got as an eigen value of a matrix. Now I would like to calculate the Modulus of this complex number. Is there any function for doing that? Regards, -- View this message in context: http://www.nabble.com/How-to-calculate-modulus-of-complex-number-tp20308154p20308154.html Sent from the R help mailing list archive

Hello, I'm trying to build a valid public ssh v2 RSA key from a java application but I have some problems understanding how the two numbers (e and n) are base64 encoded into ~/.ssh/id_rsa.pub or ~/.ssh/authorized_keys2 file. My question is what exactly is encoded into the base64 string? For example for this public key: ssh-rsa AAAAB3NzaC1yc2EAAAABIwAAAQEA6p76zG+8aOkFZT1y4O+Y7n

I have a generalized linear model to solve. I used package "geepack". When I use the correlation structure "unstructured", I get a messeage that- R GUI front-end has stopped working. Why this happens? What is the solution? The r codes are as follows: a<-read.table("d:/bmt.txt",header=T")

OK, you have my attention. But reading around on the website for 5 or 10 minutes and I'm still not sure what this is. What is it? Why would I use it? What would I use instead of it? (Who are its competitors) When would I not use it? I see this "The software is a powerful and flexible solution that simplifies the task of managing unstructured file data", but I have no idea what

I am trying to write a function that will simulate observed counts X and Y as below, I want the function to be able give many replicates, can somebody advise? thanks Oarabile #alpha,n sdx and sdy are constant, and N is a vector of length n. unstructured<-function(n,N,alpha,sdx,sdy){ Vx<-rnorm(n,mean=0,sd=sdx) Vy<-rnorm(n,mean=0,sd=sdy) thetax<-exp(alpha+Vx) thetay<-exp(alpha+Vy)

Dear R users I am analysing data from a group of twins and their siblings. The measures that we are interested in are all correlated within families, with the correlations being stronger between twins than between non-twin siblings. The measures are all calculated from survey answers and by definition have limited ranges (e.g. -5 to +5), though within the range they are approximately normally

Hi list, I have no idea if Damien Miller had the time to work on that. I have an initial patch to authenticate using PKCS#11 and ECDSA keys. This requires OpenSSL 1.0.2, prior OpenSSL versions do not expose the required interfaces to override the signature function pointer for ECDSA. The only limitation is that the OpenSSL API misses some cleanup function (finish, for instance), hence I have yet