
- •Security methods. Kerckhoff’sPrinciple
- •3)Cryptographic methods of protection of the information
- •Legislative measures
- •Administrative measures Kerckhoff’sPrinciple
- •2.Tasks of cryptography
- •Impossibility to refuse authorship .Sender needn’t have possibility no refuse his authorship.
- •7.Polyalphabetic Ciphers
- •Viginere cipher
- •Description of the cipher
- •10. Symmetric cryptosystem. Des
- •11. Symmetric cryptosystem. 3des
- •12 Symmetric cryptosystem. Aes
- •13.Block cipher modes
- •14. Stream ciphers. Prg
- •Itself synchronous stream cipher
- •15. Stream ciphers. Rc4
- •16. Public key crypto. Rsa
- •17 Public key crypto.Diffie-Hellman
- •20. Protocols. Definitions.Rules of communication.Types of protocols.Problems.
- •21.Secure Protocols. Three types of Protocol
- •22.SecureElections. Simplistic Protocol #1,2
- •23.SecureElections. Voting with Blind Signatures
- •6.1 Secure Elections
- •Voting with Blind Signatures
- •24SecureElections.Election with two organization
- •Voting with Two Central Facilities
- •25.Digital Cash Protocol
- •26 Key management. Certification problem. Certificate
- •27 Authority. X.509. Certificate Hierarchy
- •28 Pgp. Key Management in pgp. Pgp’s Web of Trust. Idea.Key Schedule.Standard ansi x9.17. Working with pgp
- •30.One way functions. Properties.Collision-resistance.Example.
- •31.One way functions md5 algorithm
- •32.One way functions sha algorithm. Sha-256, sha-384, and sha-512.
- •Tasks of cryptography
32.One way functions sha algorithm. Sha-256, sha-384, and sha-512.
Secure Hash Algorithm (SHA)
The Secure Hash Algorithm (SHA) for use with the Digital Signature Standard.According to the Federal Register. This proposed standard specified a Secure Hash Algorithm (SHA) for use with the proposed Digital Signature Standard. Additionally, for applications not requiring a digital signature, the SHA is to be used whenever a secure hash algorithm is required for Federal applications.
Description of SHA
First, the message is padded to make it a multiple of 512 bits long. Padding is exactly the same as in MD5: First append a one, then as many zeros as necessary to make it 64 bits short of a multiple of 512, and finally a 64-bit representation of the length of the message before padding.
SHA-256
SHA-512
SHA-384
SHA-384 is defined in the exact same manner as SHA-512 with the following two
exceptions:
The initial hash value H(0) is based on the fractional parts of the square roots of the ninth through sixteenth primes.
The final 384-bit hash is obtained by truncating the SHA-512-based hash output to its left-most 384 bits.
It is possible to use a symmetric block cipher algorithm as a one-way hash function. The idea is that if the block algorithm is secure, then the one-way hash function will also be secure.
The general scheme is as follows
Security methods. Kerckhoff’s Principle
Tasks of cryptography
Attack. . Type of attacks. Threats to computer systems. Threat Models. Threat Trees
Basic methods of encryption. Classification of encryption methods. Examples of simple methods.
Caesar’s cipher generalized. Other monoalphabetic ciphers. The problems.
One-Time Pad cipher.
Polyalphabetic ciphers. Vigenere Tableau.
New standard. AES. Mathematical basic. Algorithm. Key Schedule
Symmetric cryptosystem. DES
Symmetric cryptosystem. 3DES
Symmetric cryptosystem. AES
Block Cipher Modes
Stream Ciphers. PRG
Stream Ciphers. RC4
Public key crypto. RSA
Public key crypto. Diffie-Hellman
Linear Cryptoanalysis. Example
Differential Cryptoanalysis. Example
Protocols. Definitions. Rules of communication. Types of protocols. Problems.
Secure Protocols. Three types of Protocol
Secure Elections. Simplistic Protocol #1,2
Secure Elections. Voting with Blind Signatures
Secure Elections. Election with two organization
Digital Cash Protocol
Key management.. Certification problem. Certificate
Authority. X.509. Certificate Hierarchy
PGP. Key Management in PGP. PGP’s Web of Trust. IDEA. Key Schedule. Standard ANSI X9.17. Working with PGP
Protocols. Digital Cash. Examples. Key management
One way functions. Properties. Collision-resistance. Example.
One way functions MD5 algorithm.
One way functions SHA algorithm. SHA-256, SHA-384, and SHA-512.
One way functions. Using symmetric algorithms