Re: Cascading different algorithms?

From: Juuso Hukkanen (juuso929_at_tele3d.net)
Date: 05/03/05 

Date: Tue, 03 May 2005 23:28:57 +0300

On 3 May 2005 07:00:16 -0700, "Tom St Denis" <tomstdenis@gmail.com>
wrote:

[sniop]
>Forgive the naive question, but what is the SQRT attack on block
>ciphers that QC makes possible?
>
>In the case of factoring [e.g. Shor] it finds the order of the group
>which is what is used to solve RSA. Which is accomplished by having
>the order finding algorithm in many states at once.
>
>Is the idea that you would have SQRT states and they would be running
>through SQRT keys each all at once?

Hi Tom,
Wikipedia has an article:
http://en.wikipedia.org/wiki/Grover%27s_algorithm

Also note the recent article published on Nature about the possibility
that quantum computers may be easier to build than predicted.
Knill.E.Quantum computing with realistically noisy devices.Nature
434(03 March 2005).pp. 39 - 44

I know of cause nothing about any of those quak things, but Nature is
seldomly publishing total nonsense. NIST writes about this article.

http://www.nist.gov/public_affairs/releases/quantum_computers.htm

Perhaps the cryptographic community or someone should start a project
for evaluating the QC resistance of current algorithms and in case
there is doubt developing new QC resistant algorithms.

Juuso Hukkanen

Relevant Pages

  • Re: Fixed Point Square Root Improvements?
    ... non-LUT solution which is about 2-2.5 times slower than sqrt() on my Athlon ... I compared Newton-Rhapson to these algorithms also, ... bsr eax, eax ...
    (comp.lang.asm.x86)
  • Re: complexity of numerical software
    ... > which I would classify with discrete or combinatorics algorithms. ... Cody's celefunt suite of accuracy tests for complex elementary ... nonnegative normalized short floating-point numbers x, SQRT ... output error, epsilon, maybe gives you some hope of ...
    (sci.math.symbolic)
Quantcast