Pre-shared only works for deployments with low-ish number of devices. We are talking about 1000+ devices.
5,737 karma · joined June 19, 2013
Pre-shared only works for deployments with low-ish number of devices. We are talking about 1000+ devices.
But for all other devices - server, desktop, mobile phones etc which sports 64-bit CPUs clocked in GHz speeds, and GByte of storage, RAM this is seems sensible. Performing x25519 on these devices in addition to the PQC-algoritm should be a negligible cost.
We see customers getting requirement requests for using PQ safe crypto algorithms to be used in systems that will be used 30+ years. But that too is also just hedging the bets.
Quantum Key Distribution is feasible - esp for systems that don't need to move and where you own the medium. And can spend the 1000+ kUSD these machines costs. For most use cases (for example between a client and a server setting up a secure session over Internet) these machines does not solve anything. But they sure are very cool to own and deploy.
https://spectrum.ieee.org/media-library/less-than-p-greater-...
We are talking 4,5,6 orders of magnitude for several vital physical properties. Silicon scaling the last 40 years seems to me as being much easier - and that have required enormous amount of R&D including physical theory, and is bumping into physical limits. We have gone from say 500 nm to 5 nm, basically three orders of magnitude.
What makes it so clear that quantum computer technology are even possible to scale?
And yes, Quantum computers may be profoundly powerful someday, for a set of problems. Not in general.
Some organsations MAY someday have Quantum Computers capable of cracking some asymmetric keys (RSA). All of us will have access to cryptographic algorithms (inlcuding open source implementations) that can't be cracked by the Quantum Computers. These algorithms are executed on our normal, classical computers.
We already have a first set of post quantum computer cryptographic algorithms. See the NIST competition for example. Their implementations still looks immature (some have fallen against classical attacks, including side channel issues). But we'll get there. We will also have to (yet again) deal with having algorithm agility, which adds complexity.
Quantum Computers are not magical things. We can (and do) know type of problems, algorithms, operations they should be better than classical computers to solve (called quantum supremacy). Shor's algorithm, which provides exponential speedup of cracking RSA key is an example of such an algorithm.
What we so far don't consider that much is the feasibility to perform these algorithms in reality. That is, we look at the asymptotic speedup, not the practical speedup.
There is a really good paper by people from the MS PQ team that looked at this. Highly recommended:
https://cacm.acm.org/magazines/2023/5/272276-disentangling-h...
https://www.reddit.com/r/geek/comments/1ds9en/from_the_movie...
https://csdb.dk/release/?id=27625
http://www.fairlight.to/docs/text/xass_docs.htm
So productive and easy to use.
... And doesn't this also adds, creates a relationship between otherwise independent packets, potentially creating a way to tag packets through a network. Basically if I can control the arrival time of my packets to a router (I send them at a baseline fixed rate, but delay the transmit time with a pattern), packets that are then bunched together to be vector processed in the router will also be affected by this delay. I could possibly then observe this pattern at other places in the network. Thus tracing packets.
Possibly.
My thinking is that one needs to have a set of packets before being able to start processing. The first packets arriving must wait until enough packets has arrived to fill min size of the vector. And if the last packet comes "late", the arrival time of the last packet adds to the time for the other packets, thus adding something that looks like variance.
I assume there are parameters setting min number of packets in a vector, and timeouts for when to accept packets into a given vector.
https://www.vastsverige.com/sodrabohuslan/produkter/personfa...
It sounds more like you try to state that the results have no real world meaning, and that is very correct. But nobody have claimed otherwise. This is about historical computers. We all know which architecture won. Despite being slower performing a ROR.
Oh, and the best schools are really in the downtown area. Which is why children, kids, teenagers use the public transport from all around the metro area by themselves to get to the schools.
And since you comment further below about winter - yes, of course the kids move around like this in the winter too.
"At issue is RISC-V, pronounced "risk five," an open-source technology that competes with costly proprietary technology from British semiconductor and software design company Arm Holdings (O9Ty.F). RISC-V can be used as a key ingredient for anything from a smartphone chip to advanced processors for artificial intelligence."
Also, the lawmakers seems to lack a general understanding of how open source is developed, by whom and how it is being used. And what RISC-V is and what is really available:
"Representative Mike Gallagher, chairman of the House select committee on China, said in a statement to Reuters that the Commerce Department needs to "require any American person or company to receive an export license prior to engaging with PRC (People's Republic of China) entities on RISC-V technology."
Moving RISC-V International to Switzerland seems to have been a very prudent move. https://riscv.org/about/
https://en.wikipedia.org/wiki/Not_Another_Completely_Heurist...
https://homes.cs.washington.edu/~tom/nachos/
(Not sure what the possible relation to Taos would be, to make this OT. ;-)