Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
Lecture 5

Lecture 5

|Views: 2|Likes:
Published by samaher hussein
Dr. Samaher Hussein Ali
Dr. Samaher Hussein Ali

More info:

Published by: samaher hussein on Jan 25, 2013
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





College of Information Technology, University of Babylon, IraqSamaher_hussein@yahoo.com
ByDr. Samaher Hussein Ali
Cryptographic Primitives &
Requirements of Cryptosystems
Department of SoftwareThe University of Babylon
Dr. Samaher Hussein Ali
Cryptographic Primitives
Notes of Lecture 5
There are a number of basic cryptographic tools(
)used to provide information security.Examples of primitives include
encryption schemes
hash functions
, and
digital signature schemes
. Thefigure in below provides a schematic listing of the primitives considered and how they relate.
Dr. Samaher Hussein Ali
Cryptographic Primitives
Notes of Lecture 5
These primitives should be evaluated with respect to various criteria such as:
1.Level of Securit
This is usually difficult to quantify. Often it is given in terms of the number of operations required (using the best methods currently known) to defeat the intended objective.Typically the level of security is defined by an upper bound on the amount of work necessary todefeat the objective. This is sometimes called the work factor.
Primitives will need to be combined to meet various information security objectives.Which primitives are most effective for a given objective will be determined by the basic propertiesof the primitives.
3.Methods of Operation
Primitives, when applied in various ways and with various inputs, willtypically exhibit different characteristics; thus, one primitive could provide very different functionalitydepending on its mode of operation or usage.
This refers to the efficiency of a primitive in a particular mode of operation. (Forexample, an encryption algorithm may be rated by the number of bits per second which it canencrypt.)
5.Ease of implementation
This refers to the difficulty of realizing the primitive in a practicalinstantiation. This might include the complexity of implementing the primitive in either a software orhardware environment.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->