This page (revision-1) was last changed on 29-Nov-2024 16:16 by UnknownAuthor

Only authorized users are allowed to rename pages.

Only authorized users are allowed to delete pages.

Page revision history

Version Date Modified Size Author Changes ... Change note

Page References

Incoming links Outgoing links
Key size
Key size

Version management

Difference between version and

At line 1 added 240 lines
!!! Overview
[{$pagename}] in [Cryptography] or key length is the number of [bits] in a [key] used by a [Cryptographic Primitive] (such as a [cipher] or [Hash Function]).
[{$pagename}] defines the upper-bound on an [algorithm]'s security (i.e., a logarithmic measure of the fastest known [attack] against an [algorithm], relative to the [{$pagename}]), since the security of all [algorithms] can be violated by [Brute-Force] [attacks].
Ideally, [{$pagename}] would coincide with the lower-bound on an algorithm's security. Indeed, most [Symmetric Key] algorithms are designed to have security equal to their key length.
However, after design, a new attack might be discovered. For instance, [Triple DES] was designed to have a 168 [bit] [{$pagename}], but an [attack] of complexity 2112 is now known (i.e., [Triple DES] has 112 [bits] of security). Nevertheless, as long as the relation between [{$pagename}] and security is sufficient for a particular application, then it doesn't matter if [{$pagename}] and security coincide. This is important for [Asymmetric Key] [algorithms], because no such algorithm is known to satisfy this property; [Elliptic Curve] [cryptography] comes the closest with an effective security of roughly half its [{$pagename}].
[Hash Function Security|Hash Function Security Properties] has some details in regards to [{$pagename}]
!! More Information
There might be more information for this subject on one of the following:
[{ReferringPagesPlugin before='*' after='\n' }]
This page (revision-1) was last changed on 29-Nov-2024 16:16 by UnknownAuthorTop