Re: Books on cryptography with a focus on resources and performance
From: Douglas A. Gwyn (DAGwyn_at_null.net)
Date: 05/07/04
- Next message: timothy liverance: "3D matrix encrypto. No math and beyond quantum."
- Previous message: privacy.at Anonymous Remailer: "Latent-Time: 14:35"
- In reply to: Jonas: "Books on cryptography with a focus on resources and performance"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 07 May 2004 09:13:37 -0400
Jonas wrote:
> I'm looking for a book on cryptography which has not only mathematical
> aspects, but also focuses on performance issues. E.g. algorithm X is
> NP complete and encryption of algorithm Y is growing by O(NlogN) with
> increased keysize. Does anyone have any suggestions?
The standard texts mentioned in the sci.crypt FAQ cover
this to some extent.
No realization of any of the algorithms is other than O(1).
Presumably you are interested in the computational
requirements as a function of key size, which is quite
different from NP-completeness. Usually it is not hard
to estimate this from the algorithm; for example, in NAI
Labs TR #00-015, RSA encryption is treated thusly:
# of 128-bit operations = (# of 1024-bit modular squares) *
(# of 128-bit multiply result operations per 1024-bit modular square) +
(# of 1024-bit modular multiplies) *
(# of 128-bit multiply result operations per 1024-bit modular multiply)
= Floor(log2(e))*[1.5*(size of n/64)2 + 1.5*(size of n/64)] +
1*[2*(size of n/64)2 + (size of n/64)]
= 16*[1.5*(1024/64)2 + 1.5*(1024/64)] + 1*[2*(1024/64)2 + (1024/64)]
= 7056
- Next message: timothy liverance: "3D matrix encrypto. No math and beyond quantum."
- Previous message: privacy.at Anonymous Remailer: "Latent-Time: 14:35"
- In reply to: Jonas: "Books on cryptography with a focus on resources and performance"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
