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
Computational Hardness Assumption
Computational Hardness Assumption

Version management

Difference between version and

At line 1 added 18 lines
!!! Overview
[{$pagename}] implies the [Confidentiality] of the [message] is __Computationally Secure__ which implies assuming that any [attacker] is computationally limited. ([Attack Effort])
[{$pagename}] does not account for [Side-channel attacks] or other forms of [Data Leakage] [attacks].
In [cryptography], a major goal is to create [Cryptographic Primitives] with provable [security].
In some cases, [cryptographic] [protocols] are found to be [Information-theoretic Secure]; the one-time pad is a common example. However, [Information-theoretic Secure] cannot always be achieved; in such cases, cryptographers fall back to [{$pagename}].
Roughly speaking, this means that these systems are secure assuming that any adversaries are computationally limited, as all adversaries are in practice. Because hardness of a problem is difficult to prove, in practice certain problems are "assumed" to be difficult.[1]
[{$pagename}] relies that the [Algorithm] (Usually the [Cryptographic] [Algorithm]) has a high enough [Complexity] so that the [Attack Effort] is too high for the [Protected Resource] ([Item of Interest])
!! More Information
There might be more information for this subject on one of the following:
[{ReferringPagesPlugin before='*' after='\n' }]
----
* [#1] - [Computational Hardness Assumption|Wikipedia:Computational_hardness_assumption|target='_blank'] - based on information obtained 2016-03-04
This page (revision-1) was last changed on 29-Nov-2024 16:16 by UnknownAuthorTop