Re: Cohen's paper on byte order

From: Mok-Kong Shen (mok-kong.shen@t-online.de)
Date: 04/05/03 

From: Mok-Kong Shen <mok-kong.shen@t-online.de>
Date: Sat, 05 Apr 2003 10:14:22 +0200

"Douglas A. Gwyn" worte:
>
> Mok-Kong Shen wrote:
> > The document describes only an 'algorithm' ...
>
> Yes, that is the defect. Since there is no specification
> for connecting that algorithm to the real world, it is
> unusable without some further, nonstandard, specification.
> AES was meant to replace DES, not DEA.

Couldn't one say the same for the quicksort algorithm,
for example?? The most 'general' case is this: The user
has a block of information, with 128 bits designated
by 0-127 (according to him). Where these bits are is
information that an implementor has to acquire, of
course. He treats these as the similarly designated
(abstract) bits in the AES document and maps them
to the hardware bits that he choose to designate as
0-127 (bijectively). Whether these hardware bits are
linearly ordered, placed in a two- or three-dimensional
matrix or randomly distributed in space, is entirely
immaterial to the proper functioning of the algorithm,
isn't it? When these processed bits are to be
transmitted to the outside world, say over a serial
channel, well, there is a normal convention that he
has somehow to observe in transmitting 'any' chunks
of bits of his hardware (in any applications, not
only encryption, e.g. 32 bits representing an integer)
out, isn't it? (What has that particularly to do with
AES??)

M. K. Shen
has to take that into consideration

Relevant Pages

  • Re: Cohens paper on byte order
    ... It has an explicit I/O model that connects it ... The algorithm needs certainly the ... concern of the AES document, ... I was stressing that in any HLL the hardware properties ...
    (sci.crypt)
  • Re: Havent done anything real with OOP yet.
    ... But it is an algorithm description and, ... simulation needs. ... hardware to/from the network port. ... driving the abstraction of a rather specialized chunk of hardware. ...
    (comp.object)
  • Re: qubits
    ... > the available hardware states), in which case the program might run ... Shor's factorization algorithm, tough, was explicitly tought for ...
    (comp.object)
  • Re: OT : Approximate / fast math libraries ?
    ... some practical work with the algorithm will tell you the real results. ... It costs no more to calculate doubles than singles except ... depends on the hardware implementations inside the processor and the ... cycle I put into it, along with some additional benefit from hardware ...
    (Fedora)
  • Re: Cool visual illusion
    ... >>> on so that I can implement it on any hardware powerful enough to run ... I really only care about the functionality, ... Call it the algorithm instead of the ...
    (comp.ai.philosophy)