Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.os.linux.advocacy > #327593 > unrolled thread
| Started by | Jeremy Bentham <nobody@anemone.mooo.com> |
|---|---|
| First post | 2015-10-21 23:39 +0200 |
| Last post | 2015-10-27 15:46 -0600 |
| Articles | 20 on this page of 69 — 22 participants |
Back to article view | Back to comp.os.linux.advocacy
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: How Is the NSA Breaking So Much Crypto? Jeremy Bentham <nobody@anemone.mooo.com> - 2015-10-21 23:39 +0200
Re: How Is the NSA Breaking So Much Crypto? Big Bad Bob <BigBadBob-at-mrp3-dot-com@testing.local> - 2015-10-21 14:47 -0700
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-21 16:42 -0600
Re: How Is the NSA Breaking So Much Crypto? Takuya Saitoh <taka0038@gmail.com> - 2015-10-22 08:34 -0700
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-22 11:49 -0600
Re: How Is the NSA Breaking So Much Crypto? Takuya Saitoh <taka0038@gmail.com> - 2015-10-22 18:11 -0700
Re: How Is the NSA Breaking So Much Crypto? "A.M" <.m@nsn.s> - 2015-10-22 21:52 -0400
Re: How Is the NSA Breaking So Much Crypto? "Ezekiel" <zeke@nosuchemail.com> - 2015-10-22 21:58 -0400
Re: How Is the NSA Breaking So Much Crypto? Takuya Saitoh <taka0038@gmail.com> - 2015-10-22 21:34 -0700
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-23 12:29 -0600
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-23 12:24 -0600
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-23 12:19 -0600
Re: How Is the NSA Breaking So Much Crypto? meagain <rick0.merrill@gmail.com> - 2015-10-27 15:31 -0400
Re: How Is the NSA Breaking So Much Crypto? William Unruh <unruh@invalid.ca> - 2015-10-27 19:47 +0000
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-27 15:47 -0600
Re: How Is the NSA Breaking So Much Crypto? Big Bad Bob <BigBadBob-at-mrp3-dot-com@testing.local> - 2015-10-28 14:49 -0700
Re: How Is the NSA Breaking So Much Crypto? William Unruh <unruh@invalid.ca> - 2015-10-28 22:23 +0000
Re: How Is the NSA Breaking So Much Crypto? "Anonymous Remailer (austria)" <mixmaster@remailer.privacy.at> - 2015-10-29 19:56 +0100
A real quantum computer, doing real work, doesn't exist. Jeff-Relf.Me <@.> - 2015-10-27 12:50 -0700
Re: A real quantum computer, doing real work, doesn't exist. Peter Köhlmann <peter-koehlmann@t-online.de> - 2015-10-27 21:18 +0100
Re: A real quantum computer, doing real work, doesn't exist. William Unruh <unruh@invalid.ca> - 2015-10-27 20:49 +0000
Re: A real quantum computer, doing real work, doesn't exist. Siri Cruz <chine.bleu@yahoo.com> - 2015-10-27 13:53 -0700
Re: A real quantum computer, doing real work, doesn't exist. William Unruh <unruh@invalid.ca> - 2015-10-27 21:43 +0000
Better Randomness ? ! Jeff-Relf.Me <@.> - 2015-10-27 22:41 -0700
Re: Better Randomness ? ! moroney@world.std.spaamtrap.com (Michael Moroney) - 2015-10-28 14:33 +0000
Re: Better Randomness ? ! chrisv <chrisv@nospam.invalid> - 2015-10-28 09:36 -0500
Re: Better Randomness ? ! benj <none@gmail.com> - 2015-10-30 05:56 -0400
Re: Better Randomness ? ! "Ezekiel" <zeke@nosuchemail.com> - 2015-10-28 10:46 -0400
QueryPerformanceCounter() -- Better Randomness. Jeff-Relf.Me <@.> - 2015-10-28 08:28 -0700
Re: QueryPerformanceCounter() -- Better Randomness. "Ezekiel" <zeke@nosuchemail.com> - 2015-10-28 11:48 -0400
RDRAND has numerous problems. Jeff-Relf.Me <@.> - 2015-10-28 09:35 -0700
Re: QueryPerformanceCounter() -- Better Randomness. moroney@world.std.spaamtrap.com (Michael Moroney) - 2015-10-28 16:17 +0000
QueryPerformanceCounter() -- Better Randomness. Jeff-Relf.Me <@.> - 2015-10-28 09:50 -0700
Re: Better Randomness ? ! Nomen Nescio <nobody@dizum.com> - 2015-10-29 19:38 +0100
Re: Better Randomness ? ! Tim Streater <timstreater@greenbee.net> - 2015-10-29 19:14 +0000
Re: Better Randomness ? ! Snit <usenet@gallopinginsanity.com> - 2015-10-29 13:10 -0700
Re: Better Randomness ? ! benj <none@gmail.com> - 2015-10-30 05:45 -0400
Re: A real quantum computer, doing real work, doesn't exist. chrisv <chrisv@nospam.invalid> - 2015-10-28 07:07 -0500
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-28 17:13 -0600
Re: A real quantum computer, doing real work, doesn't exist. Anonymous <nobody@remailer.paranoici.org> - 2015-10-29 00:27 +0000
Re: A real quantum computer, doing real work, doesn't exist. Big Bad Bob <BigBadBob-at-mrp3-dot-com@testing.local> - 2015-10-28 14:59 -0700
Re: A real quantum computer, doing real work, doesn't exist. William Unruh <unruh@invalid.ca> - 2015-10-28 22:21 +0000
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-28 17:14 -0600
Re: A real quantum computer, doing real work, doesn't exist. Siri Cruz <chine.bleu@yahoo.com> - 2015-10-28 16:29 -0700
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-29 15:43 -0600
Re: A real quantum computer, doing real work, doesn't exist. "Anonymous Remailer (austria)" <mixmaster@remailer.privacy.at> - 2015-10-29 23:36 +0100
Re: A real quantum computer, doing real work, doesn't exist. "Rice Rocketeer" <ricerocketeer@somemail.com> - 2015-10-28 11:57 +0100
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 15:47 -0600
Re: A real quantum computer, doing real work, doesn't exist. Siri Cruz <chine.bleu@yahoo.com> - 2015-10-27 15:38 -0700
Re: A real quantum computer, doing real work, doesn't exist. Davoud <star@sky.net> - 2015-10-27 22:29 -0400
Re: A real quantum computer, doing real work, doesn't exist. deep - 2015-10-27 21:08 -0600
Re: A real quantum computer, doing real work, doesn't exist. Siri Cruz <chine.bleu@yahoo.com> - 2015-10-27 20:58 -0700
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 23:05 -0600
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 23:02 -0600
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 23:02 -0600
Re: A real quantum computer, doing real work, doesn't exist. Anonymous <nobody@remailer.paranoici.org> - 2015-10-28 10:19 +0000
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-28 17:20 -0600
Re: A real quantum computer, doing real work, doesn't exist. Anonymous <nobody@remailer.paranoici.org> - 2015-10-29 18:32 +0000
Re: A real quantum computer, doing real work, doesn't exist. Tim Streater <timstreater@greenbee.net> - 2015-10-29 19:19 +0000
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-29 20:46 -0600
Re: A real quantum computer, doing real work, doesn't exist. Tim Streater <timstreater@greenbee.net> - 2015-10-30 09:13 +0000
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-30 15:58 -0600
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 22:58 -0600
Re: A real quantum computer, doing real work, doesn't exist. William Unruh <unruh@invalid.ca> - 2015-10-27 22:47 +0000
Re: A real quantum computer, doing real work, doesn't exist. Takuya Saitoh <taka0038@gmail.com> - 2015-10-27 17:44 -0700
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-27 23:34 -0600
Re: A real quantum computer, doing real work, doesn't exist. William Unruh <unruh@invalid.ca> - 2015-10-28 19:08 +0000
Re: A real quantum computer, doing real work, doesn't exist. GreyCloud <cumulus@mist.com> - 2015-10-28 17:22 -0600
Re: How Is the NSA Breaking So Much Crypto? GreyCloud <cumulus@mist.com> - 2015-10-27 15:46 -0600
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
| From | William Unruh <unruh@invalid.ca> |
|---|---|
| Date | 2015-10-27 20:49 +0000 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <n0oo03$vkb$1@dont-email.me> |
| In reply to | #328928 |
["Followup-To:" header set to alt.computer.security.] On 2015-10-27, Peter K??hlmann <peter-koehlmann@t-online.de> wrote: > wrote: > >> GreyCloud and Rick_Merrill wrote: >>> > Right now, the NSA in Utah is using a new quantum computer to do the >>> > job. If you hear about talk or reports about experimenting with >>> > quantum computers, then it has already been done. >>> >>> And how many Qbits does it have?? >> >> Without looking, I know that >> a real quantum computer, doing real work, doesn't exist. > > And as usual, you are wrong Of course it would be good, if one wants to prevent this discussion from degenerating into a grade 2 shouting match, for you to give evidence for your statement.
[toc] | [prev] | [next] | [standalone]
| From | Siri Cruz <chine.bleu@yahoo.com> |
|---|---|
| Date | 2015-10-27 13:53 -0700 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <chine.bleu-9FF068.13532027102015@88-209-239-213.giganet.hu> |
| In reply to | #328928 |
In article <n0om2e$ok6$1@dont-email.me>, Peter Köhlmann <peter-koehlmann@t-online.de> wrote: > wrote: > > > GreyCloud and Rick_Merrill wrote: > >> > Right now, the NSA in Utah is using a new quantum computer to do the > >> > job. If you hear about talk or reports about experimenting with > >> > quantum computers, then it has already been done. > >> > >> And how many Qbits does it have?? > > > > Without looking, I know that > > a real quantum computer, doing real work, doesn't exist. > > And as usual, you are wrong The only commercial quantum computer runs only one program that finds the global minimum of a function. https://en.wikipedia.org/wiki/D-Wave_Systems -- :-<> Siri Seal of Disavowal #000-001. Disavowed. Denied. Deleted. 'I desire mercy, not sacrifice.' When is a Kenyan not a Kenyan? When he's a Canadian. That's People's Commissioner Siri Cruz now. Punch!
[toc] | [prev] | [next] | [standalone]
| From | William Unruh <unruh@invalid.ca> |
|---|---|
| Date | 2015-10-27 21:43 +0000 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <n0or5i$btl$1@dont-email.me> |
| In reply to | #328936 |
On 2015-10-27, Siri Cruz <chine.bleu@yahoo.com> wrote: > In article <n0om2e$ok6$1@dont-email.me>, > Peter K?hlmann <peter-koehlmann@t-online.de> wrote: > >> wrote: >> >> > GreyCloud and Rick_Merrill wrote: >> >> > Right now, the NSA in Utah is using a new quantum computer to do the >> >> > job. If you hear about talk or reports about experimenting with >> >> > quantum computers, then it has already been done. >> >> >> >> And how many Qbits does it have?? >> > >> > Without looking, I know that >> > a real quantum computer, doing real work, doesn't exist. >> >> And as usual, you are wrong > > The only commercial quantum computer runs only one program that finds the global > minimum of a function. That is of course sufficient to solve almost all problems if it is true. Factoring-- find the minimum over p and q of ( p q -n)^2 where n is the number and p and q are the factors. Ie, a program to efficiently find the minimum of an arbitrary function is incredibly powerful. Now the question of course is whether or not the DWave system can actually find such minima faster than a classical computer can. That is still somewhat up in the air. And whether their computer actually uses quantum mechanics in the process (rather than thermal monti-carlo say). > > https://en.wikipedia.org/wiki/D-Wave_Systems >
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2015-10-27 22:41 -0700 |
| Subject | Better Randomness ? ! |
| Message-ID | <Jeff-Relf.Me@Oct.27{10.41P.Seattle.2015}> |
| In reply to | #328949 |
Professor William_Unruh wrote: > a program to efficiently find the minimum of an arbitrary function > is incredibly powerful. > > Now the question of course is whether or not the DWave system can > actually find such minima faster than a classical computer can. > > That is still somewhat up in the air. > And whether their computer actually uses quantum mechanics > in the process (rather than thermal monti-carlo say). Better Randomness ? ! I don't think so. Seriously, _How_ could thermo/quantum randomness be better than what I've got, on my i7_4790s/Windows_8 PC ? ! How ? ! I used genetic algorithms back in 1992; it's no big deal, nothing new. "Randomness" is just ignorance, nothing more. Intrinsically, the (4D) timescape is static, immutable. "Life" is virtual, not real. We're robots, programmed to want food, water, air, etc. Like the sun, stars and everything else... we consume "exergy" (energy that can do work); i.e. we ratchet entropy.
[toc] | [prev] | [next] | [standalone]
| From | moroney@world.std.spaamtrap.com (Michael Moroney) |
|---|---|
| Date | 2015-10-28 14:33 +0000 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <n0qmbc$8pt$1@pcls7.std.com> |
| In reply to | #329079 |
Jeff-Relf.Me <@.> writes: >Professor William_Unruh wrote: >> a program to efficiently find the minimum of an arbitrary function >> is incredibly powerful. >> >> Now the question of course is whether or not the DWave system can >> actually find such minima faster than a classical computer can. >> >> That is still somewhat up in the air. >> And whether their computer actually uses quantum mechanics >> in the process (rather than thermal monti-carlo say). >Better Randomness ? ! I don't think so. >Seriously, _How_ could thermo/quantum randomness be >better than what I've got, on my i7_4790s/Windows_8 PC ? ! >How ? ! Any computer algorithm is just pseudorandomness, "ignorance" as you put it. Dig deep enough into the algorithm and you can _predict_ the next value, although doing so can be extremely difficult. On the other hand, something based on truly random events, such as radioactive decay, is, well, truly random, if implemented properly. <snip crap>
[toc] | [prev] | [next] | [standalone]
| From | chrisv <chrisv@nospam.invalid> |
|---|---|
| Date | 2015-10-28 09:36 -0500 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <ean13blf2gehml01hnjv0n7p53crrti1ns@4ax.com> |
| In reply to | #329129 |
Michael Moroney wrote: >Jeff-Relf.Me <@.> writes: *plonk*
[toc] | [prev] | [next] | [standalone]
| From | benj <none@gmail.com> |
|---|---|
| Date | 2015-10-30 05:56 -0400 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <b9HYx.8623$Ra7.3003@fx05.iad> |
| In reply to | #329131 |
On 10/28/2015 10:36 AM, chrisv wrote:
> Michael Moroney wrote:
>
>> Jeff-Relf.Me <@.> writes:
>
> *plonk*
>
excellent choice! Rolf gets it all the time.
--
___ ___ ___ ___
/\ \ /\ \ /\__\ /\ \
/::\ \ /::\ \ /::| | \:\ \
/:/\:\ \ /:/\:\ \ /:|:| | ___ /::\__\
/::\~\:\__\ /::\~\:\ \ /:/|:| |__ /\ /:/\/__/
/:/\:\ \:|__| /:/\:\ \:\__\ /:/ |:| /\__\ \:\/:/ /
\:\~\:\/:/ / \:\~\:\ \/__/ \/__|:|/:/ / \::/ /
\:\ \::/ / \:\ \:\__\ |:/:/ / \/__/
\:\/:/ / \:\ \/__/ |::/ /
\::/__/ \:\__\ /:/ /
~~ \/__/ \/__/
[toc] | [prev] | [next] | [standalone]
| From | "Ezekiel" <zeke@nosuchemail.com> |
|---|---|
| Date | 2015-10-28 10:46 -0400 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <n0qn0d$g0g$1@dont-email.me> |
| In reply to | #329129 |
"Michael Moroney" <moroney@world.std.spaamtrap.com> wrote in message news:n0qmbc$8pt$1@pcls7.std.com... > Jeff-Relf.Me <@.> writes: > >>Professor William_Unruh wrote: >>> a program to efficiently find the minimum of an arbitrary function >>> is incredibly powerful. >>> >>> Now the question of course is whether or not the DWave system can >>> actually find such minima faster than a classical computer can. >>> >>> That is still somewhat up in the air. >>> And whether their computer actually uses quantum mechanics >>> in the process (rather than thermal monti-carlo say). > >>Better Randomness ? ! I don't think so. > >>Seriously, _How_ could thermo/quantum randomness be >>better than what I've got, on my i7_4790s/Windows_8 PC ? ! >>How ? ! > > Any computer algorithm is just pseudorandomness, "ignorance" as you put > it. Dig deep enough into the algorithm and you can _predict_ the next > value, although doing so can be extremely difficult. > > On the other hand, something based on truly random events, such as > radioactive decay, is, well, truly random, if implemented properly. > Agreed. There isn't really a software substitute for external "random" entropy. -- "Coding in C#, or any other object oriented language, is *not* programming. It is only arranging predetermined classes like a child will arrange toy blocks." Fabian Russell 5 Aug 2015 <pan.2015.08.05.14.06.13@localhost.localdomain>
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2015-10-28 08:28 -0700 |
| Subject | QueryPerformanceCounter() -- Better Randomness. |
| Message-ID | <Jeff-Relf.Me@Oct.28{8.28A.Seattle.2015}> |
| In reply to | #329129 |
Replying to me, you (Michael_Moroney) wrote: > > Seriously, _How_ could thermo/quantum randomness be > > better than what I've got, on my i7_4790s/Windows_8 PC ? ! > > How ? ! > > Any computer algorithm is just pseudorandomness, > "ignorance" as you put it. > > Dig deep enough into the algorithm and you can _predict_ the next > value, although doing so can be extremely difficult. > > On the other hand, something based on truly random events, such as > radioactive decay, is, well, truly random, if implemented properly. Every second, a 64 bit counter on my 4 GigaHz PC, QueryPerformanceCounter(), goes up by another 4 billion. Use the low bits of that counter to seed srand(), and you have a nice array of PSEUDO_random numbers; no one could predict what's in the array. How, pray tell, would that not be good enough ?
[toc] | [prev] | [next] | [standalone]
| From | "Ezekiel" <zeke@nosuchemail.com> |
|---|---|
| Date | 2015-10-28 11:48 -0400 |
| Subject | Re: QueryPerformanceCounter() -- Better Randomness. |
| Message-ID | <n0qqk7$u65$1@dont-email.me> |
| In reply to | #329147 |
"Jeff-Relf.Me" <@.> wrote in message
news:Jeff-Relf.Me@Oct.28{8.28A.Seattle.2015}...
> Replying to me, you (Michael_Moroney) wrote:
>> > Seriously, _How_ could thermo/quantum randomness be
>> > better than what I've got, on my i7_4790s/Windows_8 PC ? !
>> > How ? !
>>
>> Any computer algorithm is just pseudorandomness,
>> "ignorance" as you put it.
>>
>> Dig deep enough into the algorithm and you can _predict_ the next
>> value, although doing so can be extremely difficult.
>>
>> On the other hand, something based on truly random events, such as
>> radioactive decay, is, well, truly random, if implemented properly.
>
> Every second, a 64 bit counter on my 4 GigaHz PC,
> QueryPerformanceCounter(), goes up by another 4 billion.
>
> Use the low bits of that counter to seed srand(),
> and you have a nice array of PSEUDO_random numbers;
> no one could predict what's in the array.
>
> How, pray tell, would that not be good enough ?
You don't even need QueryPerformanceCounter - Intel added hardware support
to make this even better.
<quote>
RDRAND (also RDRAND; previously known as Bull Mountain) is an instruction
for returning random numbers from an Intel on-chip hardware random number
generator. RDRAND is available in Ivy Bridge processors[a] and is part of
the Intel 64 and IA-32 instruction set architectures. AMD added support for
the instruction in June 2015.
The random number generator is compliant with security and cryptographic
standards such as NIST SP 800-90A, FIPS 140-2, and ANSI X9.82. Intel also
requested Cryptography Research Inc. to review the random number generator
in 1999 and 2012, which resulted in two published papers: The Intel Random
Number Generator in 1999, and Analysis of Intel's Ivy Bridge Digital Random
Number Generator in 2012.
</quote>
https://en.wikipedia.org/wiki/RdRand
For just about everything (banking, ssh to work, etc) this is sufficient.
But for extremely high security applications (NSA, military, etc) they want
something much more random than this.
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2015-10-28 09:35 -0700 |
| Subject | RDRAND has numerous problems. |
| Message-ID | <Jeff-Relf.Me@Oct.28{9.35A.Seattle.2015}> |
| In reply to | #329155 |
Ezekiel, RDRAND has numerous problems; if it worked properly, rand() would use it. 1. It doesn't work on most systems, including mine. 2. You can't guarantee that it'll work as advertized. I don't see how passing the low bits of QueryPerformanceCounter() to srand() wouldn't be good enough for anyone and everyone.
[toc] | [prev] | [next] | [standalone]
| From | moroney@world.std.spaamtrap.com (Michael Moroney) |
|---|---|
| Date | 2015-10-28 16:17 +0000 |
| Subject | Re: QueryPerformanceCounter() -- Better Randomness. |
| Message-ID | <n0qsem$dgu$2@pcls7.std.com> |
| In reply to | #329147 |
Jeff-Relf.Me <@.> writes: >Replying to me, you (Michael_Moroney) wrote: >> > Seriously, _How_ could thermo/quantum randomness be >> > better than what I've got, on my i7_4790s/Windows_8 PC ? ! >> > How ? ! >> >> Any computer algorithm is just pseudorandomness, >> "ignorance" as you put it. >> >> Dig deep enough into the algorithm and you can _predict_ the next >> value, although doing so can be extremely difficult. >> >> On the other hand, something based on truly random events, such as >> radioactive decay, is, well, truly random, if implemented properly. >Every second, a 64 bit counter on my 4 GigaHz PC, >QueryPerformanceCounter(), goes up by another 4 billion. >Use the low bits of that counter to seed srand(), >and you have a nice array of PSEUDO_random numbers; As I said, only pseudorandom, not genuinely random. >no one could predict what's in the array. >How, pray tell, would that not be good enough ? "Good enough" depends on what you are up to. Are you trying to generate statistical noise for a test, or to encrypt something just so a casual observer can't see a file/packet of not very significant importance? Or are you trying to keep the NSA or some foreign government from ever seeing the contents of a file? Because if the NSA really wants to, they'll figure out your pseudorandom sequence and decrypt your file just like that. Remember, computers are deterministic. I was just talking about someone about using the computer's cycle counter to test memory latency in different configurations. For a given configuration, a particular test of his sees the cycle counter increment by the same amount, as long as interrupts, timer etc. are all locked out.
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2015-10-28 09:50 -0700 |
| Subject | QueryPerformanceCounter() -- Better Randomness. |
| Message-ID | <Jeff-Relf.Me@Oct.28{9.50A.Seattle.2015}> |
| In reply to | #329176 |
Replying to me, you (Michael_Moroney) wrote: > > Every second, a 64 bit counter on my 4 GigaHz PC, > > QueryPerformanceCounter(), goes up by another 4 billion. > > > > Use the low bits of that counter to seed srand(), > > and you have a nice array of PSEUDO_random numbers; > > no one could predict what's in the array. > > if the NSA really wants to, they'll figure out your > pseudorandom sequence and decrypt your file just like that. Proof ? are you just making it up, on the fly ?
[toc] | [prev] | [next] | [standalone]
| From | Nomen Nescio <nobody@dizum.com> |
|---|---|
| Date | 2015-10-29 19:38 +0100 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <edf94e286ab256dce6ced654ddf07a22@dizum.com> |
| In reply to | #329129 |
In article <n0qmbc$8pt$1@pcls7.std.com> moroney@world.std.spaamtrap.com (Michael Moroney) wrote: > > Jeff-Relf.Me <@.> writes: > > >Professor William_Unruh wrote: > >> a program to efficiently find the minimum of an arbitrary function > >> is incredibly powerful. > >> > >> Now the question of course is whether or not the DWave system can > >> actually find such minima faster than a classical computer can. > >> > >> That is still somewhat up in the air. > >> And whether their computer actually uses quantum mechanics > >> in the process (rather than thermal monti-carlo say). > > >Better Randomness ? ! I don't think so. > > >Seriously, _How_ could thermo/quantum randomness be > >better than what I've got, on my i7_4790s/Windows_8 PC ? ! > >How ? ! > > Any computer algorithm is just pseudorandomness, "ignorance" as you put > it. Dig deep enough into the algorithm and you can _predict_ the next > value, although doing so can be extremely difficult. Seymour Cray and DEC Alpha designers managed it, AMD too. Intel, well not so much. > On the other hand, something based on truly random events, such as > radioactive decay, is, well, truly random, if implemented properly. There is nothing random about radioactive decay. > <snip crap>
[toc] | [prev] | [next] | [standalone]
| From | Tim Streater <timstreater@greenbee.net> |
|---|---|
| Date | 2015-10-29 19:14 +0000 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <291020151914153294%timstreater@greenbee.net> |
| In reply to | #329531 |
In article <edf94e286ab256dce6ced654ddf07a22@dizum.com>, Nomen Nescio <nobody@dizum.com> wrote: >In article <n0qmbc$8pt$1@pcls7.std.com> >moroney@world.std.spaamtrap.com (Michael Moroney) wrote: >> On the other hand, something based on truly random events, such as >> radioactive decay, is, well, truly random, if implemented properly. > >There is nothing random about radioactive decay. In terms of when an individual atom might decay there is. That is completely random. All you know is that the probability that it will decay in the next time-period of length equal to its half-life is just 0.5. -- New Socialism consists essentially in being seen to have your heart in the right place whilst your head is in the clouds and your hand is in someone else's pocket.
[toc] | [prev] | [next] | [standalone]
| From | Snit <usenet@gallopinginsanity.com> |
|---|---|
| Date | 2015-10-29 13:10 -0700 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <D257CB34.61F89%usenet@gallopinginsanity.com> |
| In reply to | #329542 |
On 10/29/15, 12:14 PM, in article 291020151914153294%timstreater@greenbee.net, "Tim Streater" <timstreater@greenbee.net> wrote: > In article <edf94e286ab256dce6ced654ddf07a22@dizum.com>, Nomen Nescio > <nobody@dizum.com> wrote: > >> In article <n0qmbc$8pt$1@pcls7.std.com> >> moroney@world.std.spaamtrap.com (Michael Moroney) wrote: > >>> On the other hand, something based on truly random events, such as >>> radioactive decay, is, well, truly random, if implemented properly. >> >> There is nothing random about radioactive decay. > > In terms of when an individual atom might decay there is. That is > completely random. Well, at least as far as we know. :) > All you know is that the probability that it will > decay in the next time-period of length equal to its half-life is just > 0.5. -- * OS X / Linux: What is a file? <http://youtu.be/_dMbXGLW9PI> * Mint MATE Trash, Panel, Menu: <http://youtu.be/C0y74FIf7uE> * Mint KDE working with folders: <http://youtu.be/7C9nvniOoE0> * Mint KDE creating files: <http://youtu.be/N7-fZJaJUv8> * Mint KDE help: <http://youtu.be/3ikizUd3sa8> * Mint KDE general navigation: <http://youtu.be/t9y14yZtQuI> * Mint KDE bugs or Easter eggs? <http://youtu.be/CU-whJQvtfA> * Easy on OS X / Hard on Linux: <http://youtu.be/D3BPWANQoIk> * OS / Word Processor Comparison: <http://youtu.be/w6Qcl-w7s5c>
[toc] | [prev] | [next] | [standalone]
| From | benj <none@gmail.com> |
|---|---|
| Date | 2015-10-30 05:45 -0400 |
| Subject | Re: Better Randomness ? ! |
| Message-ID | <5%GYx.22356$bG2.18189@fx26.iad> |
| In reply to | #329079 |
On 10/28/2015 01:41 AM, Jeff-Relf.Me wrote:
> Professor William_Unruh wrote:
>> a program to efficiently find the minimum of an arbitrary function
>> is incredibly powerful.
>>
>> Now the question of course is whether or not the DWave system can
>> actually find such minima faster than a classical computer can.
>>
>> That is still somewhat up in the air.
>> And whether their computer actually uses quantum mechanics
>> in the process (rather than thermal monti-carlo say).
>
> Better Randomness ? ! I don't think so.
>
> Seriously, _How_ could thermo/quantum randomness be
> better than what I've got, on my i7_4790s/Windows_8 PC ? !
> How ? !
>
> I used genetic algorithms back in 1992;
> it's no big deal, nothing new.
>
> "Randomness" is just ignorance, nothing more.
> Intrinsically, the (4D) timescape is static, immutable.
> "Life" is virtual, not real.
>
> We're robots, programmed to want food, water, air, etc.
>
> Like the sun, stars and everything else...
> we consume "exergy" (energy that can do work);
> i.e. we ratchet entropy.
There you go folks!
"Randomness" is just ignorance!
That means that to Rolf all life is random!
--
___ ___ ___ ___
/\ \ /\ \ /\__\ /\ \
/::\ \ /::\ \ /::| | \:\ \
/:/\:\ \ /:/\:\ \ /:|:| | ___ /::\__\
/::\~\:\__\ /::\~\:\ \ /:/|:| |__ /\ /:/\/__/
/:/\:\ \:|__| /:/\:\ \:\__\ /:/ |:| /\__\ \:\/:/ /
\:\~\:\/:/ / \:\~\:\ \/__/ \/__|:|/:/ / \::/ /
\:\ \::/ / \:\ \:\__\ |:/:/ / \/__/
\:\/:/ / \:\ \/__/ |::/ /
\::/__/ \:\__\ /:/ /
~~ \/__/ \/__/
[toc] | [prev] | [next] | [standalone]
| From | chrisv <chrisv@nospam.invalid> |
|---|---|
| Date | 2015-10-28 07:07 -0500 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <m5e13b1urn4innici7c90n1eihb5u81khq@4ax.com> |
| In reply to | #328949 |
William Unruh wrote: >Ie, a program to efficiently find the minimum of an arbitrary function >is incredibly powerful. cola was invented to efficiency find the minimum human mental capacity that could still manage to type. Take the Ezekreep, as an example. He thinks that proper perspective of the "Linux choice problem" is that there are "3 new distros per day", not that the *top* distros have barely changed in years. Now *that* is some fscktarded thinking! -- "Try reading it in the context of '3 new distros per day' and view it that way." - trolling fsckwit "Ezekiel"
[toc] | [prev] | [next] | [standalone]
| From | GreyCloud <cumulus@mist.com> |
|---|---|
| Date | 2015-10-28 17:13 -0600 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <4vOdnUHaGukLy6zLnZ2dnUU7-LWdnZ2d@bresnan.com> |
| In reply to | #329100 |
On 10/28/15 06:07, chrisv wrote: > William Unruh wrote: > >> Ie, a program to efficiently find the minimum of an arbitrary function >> is incredibly powerful. > > cola was invented to efficiency find the minimum human mental capacity > that could still manage to type. > > Take the Ezekreep, as an example. He thinks that proper perspective > of the "Linux choice problem" is that there are "3 new distros per > day", not that the *top* distros have barely changed in years. > > Now *that* is some fscktarded thinking! > You fit the bill quite nicely for minimum mental capacity. -- When told the reason for daylight savings time the Old Indian said, "Only the government would believe that you could cut a foot off the top of a blanket, sew it to the bottom, and have a longer blanket."
[toc] | [prev] | [next] | [standalone]
| From | Anonymous <nobody@remailer.paranoici.org> |
|---|---|
| Date | 2015-10-29 00:27 +0000 |
| Subject | Re: A real quantum computer, doing real work, doesn't exist. |
| Message-ID | <f8f735be474f030050bff24f86b05f4c@remailer.paranoici.org> |
| In reply to | #329100 |
In article <m5e13b1urn4innici7c90n1eihb5u81khq@4ax.com> chrisv <chrisv@nospam.invalid> wrote: > > William Unruh wrote: > > >Ie, a program to efficiently find the minimum of an arbitrary function > >is incredibly powerful. > > cola was invented to efficiency find the minimum human mental capacity > that could still manage to type. > > Take the Ezekreep, as an example. He thinks that proper perspective > of the "Linux choice problem" is that there are "3 new distros per > day", not that the *top* distros have barely changed in years. > > Now *that* is some fscktarded thinking! Nope, he's exactly right. And people complain about Windows update...
[toc] | [prev] | [next] | [standalone]
Page 2 of 4 — ← Prev page 1 [2] 3 4 Next page →
Back to top | Article view | comp.os.linux.advocacy
csiph-web