Re: Time complexity of Encryption Algorithms
- From: "Douglas A. Gwyn" <DAGwyn@xxxxxxxx>
- Date: Mon, 26 Jun 2006 00:43:40 -0400
"Tom St Denis" <tomstdenis@xxxxxxxxx> wrote ...
And besides it doesn't HAVE to take O(n) time to encode n blocks.
Think about parallel hardware. :-)
An O(N) algorithm remains O(N) when some finite number of
processors is assumed instead of the usual single processor.
.
- Follow-Ups:
- Re: Time complexity of Encryption Algorithms
- From: Tom St Denis
- Re: Time complexity of Encryption Algorithms
- References:
- Time complexity of Encryption Algorithms
- From: nipunshah
- Re: Time complexity of Encryption Algorithms
- From: Douglas A. Gwyn
- Re: Time complexity of Encryption Algorithms
- From: Tom St Denis
- Re: Time complexity of Encryption Algorithms
- From: nipunshah
- Re: Time complexity of Encryption Algorithms
- From: Kristian Gjøsteen
- Re: Time complexity of Encryption Algorithms
- From: avigadl
- Re: Time complexity of Encryption Algorithms
- From: Tom St Denis
- Re: Time complexity of Encryption Algorithms
- From: Padmanabhan Natarajan
- Re: Time complexity of Encryption Algorithms
- From: Tom St Denis
- Re: Time complexity of Encryption Algorithms
- From: Padmanabhan Natarajan
- Re: Time complexity of Encryption Algorithms
- From: Tom St Denis
- Time complexity of Encryption Algorithms
- Prev by Date: Re: DES advocacy
- Next by Date: Re: DES advocacy
- Previous by thread: Re: Time complexity of Encryption Algorithms
- Next by thread: Re: Time complexity of Encryption Algorithms
- Index(es):