Re: What's the Toughest Branch in Electronics?



On Sep 8, 4:53 am, ChairmanOfTheBored <RUBo...@xxxxxxxxxxxxxxx> wrote:
On Sat, 08 Sep 2007 03:02:45 GMT, D from BC <myrealaddr...@xxxxxxxxx>
wrote:

What's the Toughest Branch in Electronics?
Secure communications. Wired or RF, digital or analog.

Nothing fundamentally difficult about secure comms these days.
Review the literature, choose an algorithm that has been
in widespread use for a few years without significant vulnerabilitys
beig found and use plenty of key bits.

The problems of things like WEP have arrisen due to system designers
a)ignoring the principles that the cryptographers have spent years
working out
such as keeping the algorithm secret only helps short term and
algorithms
created by people who havn't spent twenty years learning
cryptoanalysis
usually turn out to be insecure.
and b) cuting down the crypto to fit the amount of processing
and battery power available. Technology has moved on to
the point that should not be a problem anymore.

Bob

.



Relevant Pages

  • Re: Key entropy, stream entropy, block entropy, block population entropy AKA uniique stream length
    ... If the key expansion or shuffles are generated from an algorithm only ... Because the offsets is very far between eachother. ... actual algorithm is totally scaleable *AND NOW REAL CRYPTOGRAPHERS* ... shmeems and fleems about entropy may indeed be true in some other ...
    (sci.crypt)
  • Re: US Congress already discussing bans on strong crypto
    ... There's nowhere to put a "backdoor" in the RSA algorithm. ... room to put a backdoor in the DES algorithm, and in fact when the DES ... cryptosystems by trained cryptographers is so important. ...
    (FreeBSD-Security)
  • Re: OMAC help
    ... > had a hard time with polynomial arithmetic for some reason, ... Personally I just think the specs are half-assed. ... They spent too much ... time analyzing the algorithm and not enough describing how to implement ...
    (sci.crypt)
  • Re: incorporating new ideas
    ... instead we'd have spent our time ... doing people things instead of talking to machines. ... How many successful novelists are computer people? ... who has the earliest algorithm I know of named ...
    (rec.arts.sf.composition)
  • Re: print large triangular outline using multiple sheets, possible?
    ... know I would never have thought of myself, no matter how long I spent ... Superb ... While it may be fine for an entire page, trying to fit that algorithm into ...
    (microsoft.public.vb.general.discussion)