search for: 1024bit

...24 bit and i have a little understanding problem with this. I hope somebody with some crypto-experience can enlighten me. To make that clear, that is not about allowing lower keys in general. Personally i would tend to use even longer keys(2048bit+). However Due nature of RSA-algorithm in case of 1024bit this might result in a key length of 1023 or 1024 bit. By default with a RSA Min Key length of 1024 this means all 1023bit length keys are rejected, while there is no real advantage regarding the complexity of the key when enforcing 1024bit length only. So here my question, would rejecting the...

Hello, from my understanding, using 1024bit DH parameters results in a not sufficiently secure key exchange for DH(E). Therefore I think it would be advisable to have parameters of at least 2048bit . In fact, I would see a great benefit in chosing parameter length arbitrarily. I also do not see the benefit of parameter regeneration. What...

...vlan1 class hfsc 1: root Sent 0 bytes 0 pkts (dropped 0, overlimits 0) period 0 level 2 class hfsc 1:1 parent 1: sc m1 0bit d 0us m2 220000bit ul m1 0bit d 0us m2 220000bit Sent 0 bytes 0 pkts (dropped 0, overlimits 0) period 31304 work 7533852 bytes level 1 class hfsc 1:10 parent 1:1 sc m1 1024bit d 8.0ms m2 100000bit ul m1 0bit d 0us m2 220000bit Sent 6892869 bytes 33300 pkts (dropped 0, overlimits 0) period 32750 work 6892869 bytes rtwork 6725586 bytes level 0 class hfsc 1:20 parent 1:1 sc m1 4096bit d 100.0ms m2 75000bit ul m1 0bit d 0us m2 220000bit Sent 0 bytes 0 pkts (dropped 0, o...

...classid 1:10 htb rate 10kbit ceil 128kbit quantum 1514 $tc class add dev $i parent 1:1 classid 1:20 htb rate 10kbit ceil 256kbit quantum 1514 $tc class add dev $i parent 1:1 classid 1:30 htb rate 10kbit ceil 512kbit quantum 1514 $tc class add dev $i parent 1:1 classid 1:40 htb rate 10kbit ceil 1024bit quantum 1514 $tc class add dev $i parent 1:1 classid 1:50 htb rate 10kbit ceil 2048bit quantum 1514 $tc class add dev $i parent 1:1 classid 1:60 htb rate 10kbit ceil 256kbit quantum 1514 # USED FOR HTTP/IRC $tc class add dev $i parent 1:1 classid 1:70 htb rate 10kbit ceil 128kbit quantum 1514...

...ion of reducing a vector into a scalar value. An IR instruction to do so is ideal, but I understand that the hurdle for that is very high. I'm okay with an intrinsic function call, and I heard that's a reasonable step to get to instruction. Let's say someone comes up with 1024bit vector working on char data. Nobody is really happy to see a sequence of "reduce to half" for 128 elements. Today, with AVX512BW, we already have the problem of half that size (only a few instructions less). I don't think anything that is proportional to "LOG(#elems)&qu...

HI Timo, On http://wiki2.dovecot.org/SSL/DovecotConfiguration I read in chapter SSL security settings: When Dovecot starts up for the first time, it generates new 512bit and 1024bit Diffie Hellman parameters and saves them into <prefix>/var/lib/dovecot/ssl-parameters.dat. After the initial creation they're by default regenerated every week. With newer computers the generation shouldn't take more than a few seconds, but with older computers it can take as...

...signifigantly weakening it, as MD5 had been some time ago. This is where I stopped work on the hashing, as I didn't have another function to use and didn't want to continue using a method which has already been compromised. Now - SHA2 is interesting. We can use much larger hash sizes, 1024bit even, and apply the same method as in the latest method (#5) so not all of the 1kbit (128byte) hash would need to be transfered. Even if it gets cracked, as SHA1 did, it should only mean being cryptographically weakened by a certain amount, which would still end up being larger than the 160bi...

Hello, after switching from version 2.2.7 to 2.2.7 I miss the loglines which say: ssl-params: Generating SSL parameters ssl-params: SSL parameters regeneration completed The configuration has not been changed and reads: | # 2.2.7: /usr/local/dovecot/etc/dovecot/dovecot.conf | # OS: Linux 2.6.35.14-106.fc14.i686.PAE i686 Fedora release 14 (Laughlin) ext3 | auth_mechanisms = plain login |

Hi, I plan to connect to remote Asterisk that will terminate calls to ISDN primary channel. I'd certainly like to secure this type of service, so would kindly ask for any advice on how to secure this authentication as much as reasonably possible. Since there is long IP route I guess VPN will take too much additional bandwidth... Regards, Robert.

A new version of the iproute2 utilities is available to handle the new extensions for 2.6.7. * Based on the last known good version of iproute2 from Alexy * Included most of the vendor patches (except for the stupid ones). * Got rid of lots of the glibc workarounds, I intend this to build and run on 2.6 (and 2.4) only. * Fixed some parsing and formatting bugs. * Added gigabit as a rate.

...type in the vector type, type out if different for widen/shorten and ordered if FP precision is important. It'll be harder to transform this into an instruction (mainly because of the op), but it can be done, just need time and community support. > Let's say someone comes up with 1024bit vector working on char data. Nobody is really happy to see > a sequence of "reduce to half" for 128 elements. Today, with AVX512BW, we already have the problem > of half that size (only a few instructions less). I don't think anything that is proportional to "LOG(...

Hi Graham, I'll look into the patches next, but first some questions after reading the available white papers on the net. On 24 November 2016 at 15:39, Graham Hunter <Graham.Hunter at arm.com> wrote: > This complex constant represents the runtime value of `n` for any scalable type > `<n x m x ty>`. This is primarily used to increment induction variables and > generate