search for: lcg

...ryptographically secure random numbers in two places, the error filter (to inject errors at random) and the random plugin. For this we have used either random_r or a home-brew-ish Linear Congruential Generator. Use of random_r is problematic on BSDs because it doesn't exist there. Use of the LCG is simply a bad choice. Replace both uses with a better quality and faster PRNG from David Blackman and Sebastiano Vigna called ‘xoshiro256** 1.0’ (http://xoshiro.di.unimi.it/). This is licensed under a public-domain license so it compatible with the licensing of nbdkit. This also fixes a bug in...

...ryptographically secure random numbers in two places, the error filter (to inject errors at random) and the random plugin. For this we have used either random_r or a home-brew-ish Linear Congruential Generator. Use of random_r is problematic on BSDs because it doesn't exist there. Use of the LCG is simply a bad choice. Replace both uses with a better quality and faster PRNG from David Blackman and Sebastiano Vigna called ‘xoshiro256** 1.0’ (http://xoshiro.di.unimi.it/). This is released into the public domain (where possible) so it compatible with the licensing of nbdkit. This also fixe...

v2: - Fix seeding. - Add a test that nbdkit-random-plugin is producing something which looks at least somewhat random. Rich.

I can't run a function which generates random numbrers using linear congruential generator. My multiplier is a=5+8^6, increment is b=1 and modulo is m=2^30. the code I have written works for modulo upto m=2^28. For m= 2^29 , it says, can not allocate memory for the vector or something like that. For m= 2^31 or more, its says the argument "for i in 1:m " is too large in

...ure random numbers in two > places, the error filter (to inject errors at random) and the random > plugin. For this we have used either random_r or a home-brew-ish > Linear Congruential Generator. Use of random_r is problematic on BSDs > because it doesn't exist there. Use of the LCG is simply a bad > choice. > > Replace both uses with a better quality and faster PRNG from David > Blackman and Sebastiano Vigna called ‘xoshiro256** 1.0’ > (http://xoshiro.di.unimi.it/). This is released into the public > domain (where possible) so it compatible with the licens...

...ound 16 kb/s. At those rates, we sometimes only have enough bits to code a single CELT band (8 - 9.6 kHz). When that happens in hybrid mode (unlike CELT-only), the second band (CELT band 18, from 9.6 to 12 kHz) cannot use folding because it is wider than the amount already coded, and falls back to LCG noise. Because it can also happen on transients (e.g. stops), it can cause audible pre-echo. My proposed solution is to fix the folding behaviour so that it is never forced to fall back to LCG due to not enough folding data. This is achieved by simply repeating part of the first band in the foldin...

...(This is a pretty strange one, but it's possible.) The attacker is forced to rely on side channel information such as timing channels in an attempt to discover the length of the inserted NOP sleds. This sounds like an extraordinarily difficult task, but possibly doable. With a weak PRNG like a LCG, for example, you may have sufficient information to break it [2] (I believe there are better attacks, but this is the first that came up with a quick search). 3. Remote attacker who can use a memory disclosure bug to read the contents of the memory. Like attacker 1, the defense can be bypassed....

Dear all, I''m trying to do this. Say for example, I want this link: "liblcgdm.so -> liblcgdm.so.1.8.0" to be present on the client only if "lcgdm- libs-1.8.0-1sec.sl5" is already listed. I already have this to create the link: file { ''liblcgdm.so'': ensure => symlink, name => ''/opt/lcg/lib/liblcgdm.so'&...

Dear all, I have observed a behavior that doesn''t seem (to me) to match the documentation. Specially, about tagging, the doc says: " Automatic Tagging All language statements enclosed in a node, define or class structure (read more about puppet control structures [[Language Tutorial]] ) will automatically be tagged with the name of that statement. These automatically- applied

...uot; (0.126s), but all other times I've tested it was around 0.169s. Control Master setup: Host * ControlPath ~/.ssh/master-%l-%r@%h:%p ControlMaster auto 5) SSH with ControlMaster: Opening the background control master: # ssh -f -N nagtest@@host.example.org # time ssh nagtest at lcg-lrz-dc20.grid.lrz-muenchen.de /usr/lib/nagios/plugins/check_load -w 15,10,5 -c 30,25,20 OK - load average: 0.00, 0.00, 0.00|load1=0.000;15.000;30.000;0; load5=0.000;10.000;25.000;0; load15=0.000;5.000;20.000;0; real 0m0.045s user 0m0.004s sys 0m0.000s => Fastest result with SSH so far. 6) S...

...ters: if ((fast_random() % (1 << > counter)) == 0) counter++; > > This option did not receive any attention. While it has O(1) memory > consumption and reduces contention. > Note that there are several tunables here: first -- how implement > fast_rand: it can be a per-thread LCG, or per-thread counter or set of > counter, or something else; second -- frequency of increment, e.g. it > actually can be additive and/or bounded (because if we reduce frequency of > increments by 1000x, this must be enough). > > > > > In Google GCC, we implemented another...

...(This is a pretty strange one, but it's possible.) The attacker is forced to rely on side channel information such as timing channels in an attempt to discover the length of the inserted NOP sleds. This sounds like an extraordinarily difficult task, but possibly doable. With a weak PRNG like a LCG, for example, you may have sufficient information to break it [2] (I believe there are better attacks, but this is the first that came up with a quick search). Hi Stephen, Thanks for spelling out the possible attack models in detail. This is pretty much the way we were thinking. However, I wanted...

Hi, I failed to search for R package providing random number generator of "Park and Miller". Anyone know any R package supporting this kind of function? Thanks, Grace -- View this message in context: http://www.nabble.com/Random-Number-Generator-of-Park-and-Miller-tf3636501.html#a10154554 Sent from the R help mailing list archive at Nabble.com.

Hi, I'm not sure whether the client or the server is at fault (probably the client), but it's clearly a regression for me. I'm using the LCG Profimail (http://lonelycatgames.com/?app=profimail) application for my Symbian smartphone which has quite decent IMAP capabilities. Amongst others it can do IMAP IDLE (which has to be statically enabled in the server settings, so it's not used based on the server capabilities). After upgradi...

On Mon, Aug 26, 2013 at 9:14 PM, Todd Jackson <quantum.skyline at gmail.com>wrote: > > > We would also include a secure random number generator which links >> > against OpenSSL. This would of course be an optional module disabled >> > by default, but is necessary so the randomization is cryptographically >> > secure and useful in security applications.

...secure RNG is considered best-practice for any randomness used for security purposes. Since the RNG we are proposing is still very fast, there doesn't appear to be a significant disadvantage to using it. We do need a fallback RNG when OpenSSL is unavailable, and have therefore included a simple LCG as well. I have attached our current patches against r190882, as well as a bit of documentation. Not sure what the next steps here are, but feel free to test out the code and let us know how it goes. - stephen -------------- next part -------------- A non-text attachment was scrubbed... Name: US...

...gt; counter)) == 0) counter++; >>> >>> This option did not receive any attention. While it has O(1) memory >>> consumption and reduces contention. >>> Note that there are several tunables here: first -- how implement >>> fast_rand: it can be a per-thread LCG, or per-thread counter or set of >>> counter, or something else; second -- frequency of increment, e.g. it >>> actually can be additive and/or bounded (because if we reduce frequency of >>> increments by 1000x, this must be enough). >>> >>> >>>...

> > We would also include a secure random number generator which links > > against OpenSSL. This would of course be an optional module disabled > > by default, but is necessary so the randomization is cryptographically > > secure and useful in security applications. > > I am not sure why you need this feature. You can provide LLVM with a > SEED value that can be

On Apr 17, 2014, at 2:04 PM, Chandler Carruth <chandlerc at google.com> wrote: > On Thu, Apr 17, 2014 at 1:27 PM, Justin Bogner <mail at justinbogner.com> wrote: > Chandler Carruth <chandlerc at google.com> writes: > > if (thread-ID != main's thread-ID && shard_count < std::min(MAX, NUMBER_OF_CORES)) { > > shard_count = std::min(MAX,

https://bugzilla.mindrot.org/show_bug.cgi?id=2573 Bug ID: 2573 Summary: dead sessions cannot be closed with ~. Product: Portable OpenSSH Version: 3.7.1p2 Hardware: Other OS: Linux Status: NEW Severity: normal Priority: P5 Component: ssh Assignee: unassigned-bugs at mindrot.org