Scribd
Upload
35 views2 pages

Theorie Securite

Computer security is important for systems used in online voting, taxes, and medical records. There are different security threats and protections to consider. Common risks include unauthorized access to resources, identity theft, access to confidential data, and falsification. Effective security systems rely on complex mathematical problems that make certain actions difficult while allowing other necessary functions to be performed quickly. Algorithmic complexity analysis characterizes how efficiently algorithms use resources like time and memory.

Uploaded by

Colin Dusart
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
35 views2 pages

Theorie Securite

Computer security is important for systems used in online voting, taxes, and medical records. There are different security threats and protections to consider. Common risks include unauthorized access to resources, identity theft, access to confidential data, and falsification. Effective security systems rely on complex mathematical problems that make certain actions difficult while allowing other necessary functions to be performed quickly. Algorithmic complexity analysis characterizes how efficiently algorithms use resources like time and memory.

Uploaded by

Colin Dusart
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

RESG4 2019/2020

RESG4: security
Introduction
Computer security is necessary to our society: it is being used in online voting system, online
tax forms or even online medical data.
After WW2, it was necessary to protect our computer systems. There are different types of
threats and protections. The main problem is that the stronger the security, the heavier it is.
That’s why we have to analyse each risk and their probability to occur.
The most common risks are:

 Access to a restricted resource or service


 Usurpation of identity
 Access to confidential data
 Falsification
For each of these risks, there are counter-attacks and protections.

Objectives
Many security systems rely on considerable amount of time to solve problems: number
factorisation, function inversion, combinatorial and statistical optimisation, etc.
[A REMPLIR AVEC LE RESTE QUAND LES DIAS SONT PUBLIEES]

1
RESG4 2019/2020

Algorithmic complexity
Efficiency
Resources available during execution are time and memory limited: algorithms have to be
efficient.

Security
It relies on complex mathematical problems:

 It must be easy to compute some function (fast)


 It must be hard to perform some actions (slow)
We need a notion to characterize efficiency.

Context
Libraries details algorithmic complexity (by using the worst case and asymptotic behaviour)
or talk about easy and hard problems. Example: “In the worst case, the number presents…”
or “It’s hard to compute a path in a graph”.

Counting elementary instructions


To define algorithmic complexity, it’s required to count elementary operations executed by
the program: atomic operations (running for the same durations), arithmetic and logical
operations, memory access, assignations, etc.

Detailed analysis
CF the example on dia 5/6.

 2 instructions: memory access and assignation


o Split iterations
 2 instructions (I = 0 and I < n)
 2 instructions (n times)
 The if statement is always considered (worst case)
o 2 instructions (n times)
 The body of the if statement runs with 2 instructions (n times)

Asymptotic behaviour
Counting elementary operations is boring: we’re interested in asymptotic behaviour, when n
is large.
Easy is when the complexity is bounded by a polynomial (polynomial above).

You might also like