Free Essay

Submitted By alagurajavel

Words 1831

Pages 8

Words 1831

Pages 8

A First look on Terminologies Now its high time to know the basic terminologies of Cryptography. Firstly the text that we type in the human understandable format is called as the Plain Text. The plain text is then converted to a generally incomprehensive form called as the Cipher text using a technique called Encryption which usually does this, and the cipher is transmitted. Precisely a particular encoding way is chosen by a series of letters or numbers for the encryption and the decryption called as the Key. The cipher when reaches the receiver is converted back to the plain text form by the usage of a key and the technique called as Decryption or Deciphering. Ciphering and deciphering follow specified formats making them a privilege to be used by the definitions of specified algorithms for the purpose. Basically key system in cryptology is of two types: Symmetric, where ciphering and the deciphering keys are the same and Asymmetric where there is a dual key usage namely the public and the private key .Apart from this there are two ways to encrypt and decrypt itself: Stream (de)ciphering and the block (de)ciphering. In stream method the data is encrypted on a bit by bit basis whereas in the other method it is done on a Byte by Byte basis. Also one more important term here is Cryptanalysis which is the the reverse of cryptography. i.e. breaking the code and the people involved in this are cryptanalysts and the the most basic technique used by them for breaking the symmetric key code is Brute Force Attack .

Foundations of network security

Network security has a number of bases for a well defined secure communication. Though cryptography has a role to play essentially in the first three only, Let’s glance through this one by one. ➢ Confidentiality: The sender and the receiver alone must comprehend the text. This is achieved by the principles of encryption and decryption. ➢ Authentication: Both the sender and the receiver must be able to confirm that the other party with which they are communicating is indeed who or what they claim to be. This is achieved by the principle of digital signatures. ➢ Message Integrity: Even if authentication is established, if the data integrity is lost security is poor. So to ensure that the data is not altered either maliciously or accidentally cryptography along with the hash function usage guarantees message integrity. ➢ Access control: When confidentiality, authentication and message integrity are all confirmed, security perfection lacks without a proper access control and this is provided by the package filters and the application gateway using firewalls.

Time to Race Off…. Now that our engine is started ,its time we race off with the techniques in practice in cryptography. Basically the two techniques used are the symmetric and the asymmetric key techniques. Of late the Hybrid key technique has come into the picture using both the techniques above. Also digital signatures and message digests useful in authentication and nonrepudiation. Now let’s dissect all the techniques one by one. Access control could be done by firewalls and not cryptography and hence we leave with a superficial outline of the access control feature.

Confidentiality:

Symmetric key cryptography: All cryptographic techniques involve substitution of one thing for another, for example taking a piece of plain text and then computing and substituting the appropriate cipher text to create the encrypted message . Three different categories of this particular technique are ; ▪ Caesar cipher ▪ Mono alphabetic cipher ▪ Poly alphabetic cipher

To under stand the basic functioning of this technique carefully browse through this figure below [pic]

The principle behind this particular technique is that the encryption and the decryption key used are essentially the same and works assuming that the sender and the receiver (only) know this symmetric/secret key. It is usually pretty simple to cipher and decipher using this technique and hence there is lack of enough security. The figure explains data transmission: Alice encrypts the message using the agreed secret key(that is usually provided by a Key Distribution Center(KDC)or agreed upon with Bob). And Bob decodes it using the secret key again to get back the plain text.

Coming to the Cipher key mechanism which has been the oldest form of crypts was in practice since the period of Julius Caesar .Here every letter of the plain text is substituted by the letter (that is k letters later where k is a number representing the position of the alphabet, for e.g. a=1 & z=26). The disadvantage of this technique is that the key space which is the number of combinations of the keys that can be used is limited to 25 because substitution of a letter that is 26 letters later would result in the plain text again making encryption a waste. This small key space limits the security when a brute force attack(systematic trial of all possible keys) is performed. An e.g. for this is if k=3;

|PLAIN |This is Bob. |

|CIPHER |Wklv lv Ere. |

In the Mono alphabetic cipher technique a random substitution of letters for every alphabet and hence making the brute force attack delayed as it increases the key space to 26! Keys. One sample monoalphabetic key is as follows

|PLAIN |a |

|Pass phrase |CAT |

|Copied Key |CATCA TCATC |

|Key Converted to Numbers |3 1 20 3 1 20 3 1 20 3 |

|[pic] |[pic] |

|Plaintext |H E L L O W O R L D |

|Cipher text |K F G O P N R S X G |

Public key cryptography: The main disadvantage of using a secret key is that the sender and the receiver must communicate at least once about their secret key in a secure environment. In remote networks this is not possible as they do not meet even once. This gave birth to a new technique called the Public key cryptography A public key infrastructure does not require shared confidential keys to be pre-placed in order for people to communicate. Instead, each user has two related keys: a public key and a private key. As the names imply, the public key is published or stored in publicly accessible directories and the value private key is a secret, known only by the user. There is no magic involved; only the use of complex mathematics to effectively hide or make indeterminable the part of the key that must be kept secret, the private key. To use this concept in real systems, each communicant is given or generates his own public key and private key pair. Consider the figure below for a better comprehension.

[pic]

In the above figure, Alice uses Bob's public key (shown as EBob) to encrypt the session key. When Bob receives Alice's message, he decrypts it using his private key (DBob). Only Bob can read the encrypted session key since only he has the private key. Usually the notations Kb+ and Ka+ are the public keys of Bob and Alice and Kb- and Ka- are the private key of Bob and Alice .The public and private key generations is effectively done using RSA algorithm which is as follows; The RSA algorithm has two interrelated phenomena; ➢ Generation of the key pair ➢ Encryption & decryption using the key

Here's the relatively easy to understand math behind RSA public key encryption. 1. Find P and Q, two large (e.g., 1024-bit) prime numbers. 2. Compute n=pq & z=(p-1)(q-1). 3. Choose e 64) { c[0] = (char) (65+((input.charAt(x) + shift)%65)%26); } else if (input.charAt(x) < 123 && input.charAt(x) > 96) { c[0] = (char) (97+((input.charAt(x) + shift)%97)%26); } else { c[0] = input.charAt(x); } output.append(new String(c));}} return message; }

Public Key code: RSA implementation public void keyGen() { try { BigInteger p = new BigInteger(pText.getText()); BigInteger q = new BigInteger(qText.getText()); BigInteger pq = p.multiply(q); pqText.setText(pq.toString()); BigInteger o = new BigInteger("1"); BigInteger phi = pq.subtract(p).subtract(q).add(o); BigInteger e = new BigInteger(eText.getText()); dText.setText(e.modInverse(phi).toString());} catch(NumberFormatException e) { messages.setText("p, q and e must be integers");} catch(/*Arithmetic*/ Exception e) { messages.setText("e must be coprime to (p-1)(q-1)");}} public void encrypt() { BigInteger n = new BigInteger("0"); BigInteger k = new BigInteger("0"); Try { n = new BigInteger(nText.getText()); k = new BigInteger(expText.getText());} catch(NumberFormatException e) { messages.setText("n and key must be integers."); System.exit(1);} String m = new String(); for (int x = 0; x < mText.getText().length(); x++) { m += String.valueOf( (int) mText.getText().charAt(x) + 100);} BigInteger mess = new BigInteger(m); if (mess.compareTo(n) == 1) { messages.setText("Message bigger than modulus (break into smaller messages or use larger modulus)"); System.exit(1); } BigInteger c = mess.modPow(k, n); cText.setText(c.toString());} public void decrypt() { BigInteger n = new BigInteger("0"); BigInteger k = new BigInteger("0"); try {n = new BigInteger(nText.getText()); k = new BigInteger(expText.getText());} catch(NumberFormatException e) { messages.setText("n and key must be integers."); System.exit(1);} BigInteger mess = new BigInteger(cText.getText()); BigInteger c = mess.modPow(k, n); String code = c.toString(); String m = new String(); for (int x = 0; x < code.length(); x += 3) { char ch[] = new char[1]; ch[0] = (char) (Integer.parseInt(code.substring(x, x+3)) - 100); m += new String(ch);} mText.setText(m);}}

Finale:

With this Cryptography is no more a mystery. Aren’t the confusing threads unwounded? Wont this be a good start for a novice? Wouldn’t the codes be a food for the brains for the professionals? For all this the only answer we sincerely hope is YES. And now I am sure you wouldn’t be puzzled if I say “Fgzmj xnt” for a thank you.

Bibliography: Computer Networking, James.F.Kurose and Keith.W.Ross

Net references: http://www.ssh.fi/support/cryptography/index.html http://www.itsecurity.com/papers/p7.htm

[1]

-----------------------

[1]

Premium Essay

...Symmetric Cryptography Secret writings have been found in many civilizations dating back to thousands of years where wide spread writings were adopted. Some of these civilizations included the Egyptians with their use of hieroglyphics, the Greeks and Spartan and the use of Scytale, and the Romans with the use of the Caesar Cipher. All these encryption methods could be thought of as symmetric encryption, which uses the same key to encrypt and decrypt the ciphertext. With a more contemporary look at symmetric key encryption with computer data, we can classify it into two categories called block ciphers and stream ciphers. The data in a block cipher would be broken down into specific sizes, for example 64-bit blocks or 128-bit blocks, which then the blocks would be encrypted separately. In stream ciphers, data would be encrypted in a stream of bits as oppose to dividing the data into blocks of bits. The decryption process for these two classification of symmetric encryption, of course, would be to use the same encryption key. Differences and Similarities with Symmetric and Asymmetric The fundamental difference between symmetric and asymmetric cryptography would be that asymmetric uses two keys, a public and private key, for encryption and decryption. If a private key is used to encrypt, then a related public key would be used to decrypt. This could also work the other way around when a public key is used to encrypt, then a related private key would be used to decrypt.......

Words: 558 - Pages: 3

Free Essay

...Define one type of cryptography and describe the security features. Asymmetric Cryptography: Digital Signatures Most of the time when we mention cryptography, or put asymmetric in front of it we are met with just plain blank stares. In the following paragraphs I will attempt to explain what it is, and give examples on its use. First an explanation of Public Key Infrastructure, or PKI. A cryptographic system uses two keys, a public key known to everyone and a private key, the private key has full control to the key owner, and has to keep in secured environment. A unique feature to the public key system is that the public and private keys are related in such a way that only the public key can be used to encrypt messages and only the corresponding private key can be used to decrypt them. Moreover, it is virtually impossible to distinguish the private key if you know the public key. When employee A wants to send a secure message to employee B, you use the employee B’s public key to encrypt the message. Employee B, then uses their private key to decrypt it. Public Key cryptography, is also called asymmetric encryption because it uses two keys instead of one key (symmetric encryption). Next, for my example of a process that utilizes asymmetric cryptography, is Digital Signatures. I will be using employee’s A and B as my subjects to explain the digital signature process. First, from employee A’s point of view the signing process is simple. This is because few steps are......

Words: 589 - Pages: 3

Premium Essay

...THE PURPOSE OF CRYPTOGRAPHY Cryptography is the science of writing in secret code and is an ancient art; the first documented use of cryptography in writing dates back to circa 1900 B.C. when an Egyptian scribe used non-standard hieroglyphs in an inscription. Some experts argue that cryptography appeared spontaneously sometime after writing was invented, with applications ranging from diplomatic missives to war-time battle plans. It is no surprise, then, that new forms of cryptography came soon after the widespread development of computer communications. In data and telecommunications, cryptography is necessary when communicating over any untrusted medium, which includes just about any network, particularly the Internet. Within the context of any application-to-application communication, there are some specific security requirements, including: • Authentication: The process of proving one's identity. (The primary forms of host-to-host authentication on the Internet today are name-based or address-based, both of which are notoriously weak.) • Privacy/confidentiality: Ensuring that no one can read the message except the intended receiver. • Integrity: Assuring the receiver that the received message has not been altered in any way from the original. • Non-repudiation: A mechanism to prove that the sender really sent this message. Cryptography, then, not only protects data from theft or alteration, but can also be used for user authentication. There are, in general, three......

Words: 442 - Pages: 2

Premium Essay

...In the 20th- century cryptography was adopted by international government to protect private and sensitive information and for communication purposes. Cryptography is known as the science of secret writing that enables storage and transfer of information that is hidden from everyone, but only can read by those who are authorized. The concept of cryptography is to protect confidential information and to assure the identity of people who send electronic messages and conduct electronic transactions are who they say they are. There are also various types of cryptography for example symmetric keys or shared- secret cryptography, is when you use the same key to both encrypt and decrypt a message. The most common form of symmetric key cryptography is the data Encryption standard. The second type of cryptography is asymmetric key cryptography, two keys are needed. A message encrypted using one key can only be decrypted using the other and vice versa. One key is called public key and the other is called the private key. Cryptosystem disguises messages, allowing only selected people to see though the disguise. The mechanisms that make up a strong cryptosystem is the size and means used to protect cryptographic keys. The longer the key the harder it is to break the encryption. A cryptosystem is considered strong only until it’s cracked. Strong cryptosystems produce cipher text that always appears random to standard statistical test. They also resist all known attacks on cryptosystem.......

Words: 349 - Pages: 2

Premium Essay

...passwords. One essential aspect for secure communications is that of cryptography, which is the focus of this chapter. But it is important to note that while cryptography is necessary for secure communications, it is not by itself sufficient. The reader is advised, then, that the topics covered in this chapter only describe the first of many steps necessary for better security in any number of situations. This paper has two major purposes. The first is to define some of the terms and concepts behind basic cryptographic methods, and to offer a way to compare the myriad cryptographic schemes in use today. The second is to provide some real examples of cryptography in use today. I would like to say at the outset that this paper is very focused on terms, concepts, and schemes in current use and is not a treatise of the whole field. No mention is made here about pre-computerized crypto schemes, the difference between a substitution and transposition cipher, cryptanalysis, or other history. Interested readers should check out some of the books in the references section below for detailed — and interesting! — background information. 2. THE PURPOSE OF CRYPTOGRAPHY Cryptography is the science of writing in secret code and is an ancient art; the first documented use of cryptography in writing dates back to circa 1900 B.C. when an Egyptian scribe used non-standard hieroglyphs in an inscription. Some experts argue that cryptography appeared spontaneously sometime after writing was......

Words: 7926 - Pages: 32

Premium Essay

...History of Cryptography Developments in cryptography | Period | Development | 2000 BC | In Egypt, hieroglyphics were used in inscriptions. | 500-600 BC | Hebrews used the atbash method for encryption. In this method, each letter of the alphabet mapped to a different letter to hide the true meaning of a word. | 487 BC | The Spartans used the scytale for encryption – messages were written on paper wrapped around a wooden rod. The paper was then unwrapped and sent. The recipient could read the message only by wrapping this paper on a rod of the same length and diameter. | 100-44 BC | Julius Caesar used an encryption method similar to the atbash method. He shifted each letter of the alphabet by a fixed number of places to send encrypted messages. | 1379 | Gabrieli di Lavinde developed the nomenclator. | 1466-1467 | The first polyalphabetic cipher was invented, which was much stronger than the nomenclator. | 1518 | Johannes Trithemius invented a steganographic cipher in which each letter was represented as a word taken from a succession of columns. | 1553 | Giovan Batista Belaso introduced the use of a passphrase as the key for a repeated polyalphabetic cipher. In 1563, Giovanni Battista Porta introduced the digraphic cipher and classified ciphers as transposition, substitution, and symbol substitution. | 1585 | Blaise de Vigenere developed the polyalphabetic substitution cipher. William Frederick Friedman published a book on cryptography, and is known as the...

Words: 1015 - Pages: 5

Free Essay

...practical purposes, it is impossible to crack a RSA algorithm. § PGP (Pretty Good Privacy) is probably the best implementation of RSA. It is now owned by Symantec. § Other free products (which do not tightly integrate into email, for example) are available § Understand that PKI is NOT the same thing as public key encryption Fundamentals of Information Systems Security © 2012 Jones and Bartlett Learning, LLC www.jblearning.com Page 5 Fundamentals of Information Systems Security © 2012 Jones and Bartlett Learning, LLC www.jblearning.com Page 6 Public Key Infrastructure (PKI) is a set of hardware, software, people, policies, and procedures needed to create, manage, distribute, use, store, and revoke digital certificates. In cryptography, a PKI is an arrangement that binds public keys with respective user identities by means of a certificate authority (CA). The user identity must be unique within each CA domain. The binding is established through the registration and issuance process, which, depending on the level of assurance the binding has, may be carried out by software at a CA, or under human supervision. The VA (Verification Authority) checks authentication. The PKI role that assures this binding is called the Registration Authority (RA). For each user, the user identity, the public key, their binding, validity conditions and other attributes are made un-forgeable in public key certificates issued by the CA. The term trusted third party (TTP) may also......

Words: 1799 - Pages: 8

Free Essay

...Course Title: Cryptography Section 1-1 Topic: Introduction To Cryptography Confidentiality, Integrity, Availability and Authentication How companies use cryptography How penetration testers can also use cryptography Tools, Techniques and Attacks Academics discusses history of encryption. Academics simply encrypt or hash, why aren't people using hashing more? Professional is just, encrypt or not, hash or just verify Section 1-2 Topic: Key Concepts of Cryptography: PKIS & Encryption Learning Objectives: Cryptography is one of the most underrated courses of study in the industry. Of those who do study it, issues with comprehension tend to hinder individual mastery. By taking this course, learners will finally be able to grasp all the critical concepts, theories and practices associated with Cryptography. This Cryptography presentation discusses and demonstrates the key concepts of Cryptography from attacks, PKIs and Encryption in detail. You’ll learn about the difference between public and private keys and about the similarities and differences between symmetry & asymmetry. We’ll also discuss the concept of integrity and confidentiality and their relationships to/with protocols. This Cryptography course will help you master the basics of Cryptography as you begin to develop the discipline needed to become an accomplished pen tester. Keys and Principles 1. Keys 1a. Symmetric - also referred to as same keys, private key, symmetric key - same......

Words: 3749 - Pages: 15

Premium Essay

...History of Cryptography AN EASY TO UNDERSTAND HISTORY OF CRYPTOGRAPHY Contents 1. Introduction 2. Classical Encryptions (Ancient Times) 3. Classical Encryptions (Middle Ages) The Cipher of Mary Queen of Scots Vigenère Ciphers Uesugi Cipher 3 4 6 6 6 7 4. Modern Ciphers: Ciphers during World War I and the Emergence of Encryption Machines German Communication Cables Disconnected by the United Kingdom Zimmermann Telegram ADFGVX Cipher The Birth of Enigma 8 8 8 8 9 5. Modern Ciphers: Encryptions in the Computer and Internet Era DES Cipher Public-Key Cryptosystem RSA Cipher Decrypting the DES Cipher Responsive Action of Cipher Enhancements for SSL 10 10 10 11 12 12 6. The Future of Encryption 7. Conclusion: Enhancing the Effectiveness of Encryptions used for SSL References 13 14 14 2 © 2013 Thawte, Inc. All rights reserved. Thawte, the thawte logo, and other trademarks, service marks, and designs are registered or unregistered trademarks of Thawte, Inc. and its subsidiaries and afﬁ liates in the United States and in foreign countries. All other trademarks are property of their respective owners. 1. Introduction E ncryption and related technologies are widely and frequently used as a means of ensuring that information is secure, and their importance has been growing with the increasingly widespread utilization of the Internet. The use of encryption can be traced to as far back as about 3000 B.C., during the Babylonian Era. Encryption......

Words: 6411 - Pages: 26

Free Essay

... CRYPTOGRAPHY & ONLINE BANKCARD TRANSACTIONS Keller Graduate School of Management SE577ON_A – Cryptography and Security Mechanisms NOV10 Alicia Franklin Cryptography for an Extranet Table of Contents I. Online Banking Overview ………………………………………………3 II. Security Threats to Businesses…………………………………………..3 III. Cross Site Attacks ………...…………………………………………….4 IV. Mitigating Cross Site Attacks ………………………………………….5 V. Phishing ………………………………………………………………….6 VI. Cryptography .…………………………………………………………..6 VII. Secret Key Cryptography .………………………………………………7 VIII. Public Key Cryptography.………………………………………………7 IX. Hash Functions ……..…………………………………………………...7 X. Biometrics …………………………...…………………………………...8 XI. Summary ………………………………………………………………8 XII. References ……………………………………………………………….9 I. Online Banking Overview The number of malicious applications targeting online banking transactions has increased dramatically in recent years. This represents a challenge not only to the customers who use such facilities, but also to the institutions who offer them, as evidenced by an ongoing trail in the US. These malicious applications employ two kinds of attack vector – local attacks which occur on the local computer, and remote attacks, which redirect the victim to a remote site. The possibility also exists that both approaches will be combined. Some attacks may be foiled by adopting security measures such as transaction numbers (TAN). However, it is likely that the......

Words: 1753 - Pages: 8

Free Essay

...* Encrypt (not decrypt) a message “by hand,” using techniques used from the Whitman/Mattord Principles of Information Security online pdf file and online lecture. * After doing that, you will download the Cryptool 1 software used to perform cryptography. You will then perform the same cryptographic techniques using Cryptool 1. * Before or after performing the above two parts of the assignment, you will do the Virtual Cloud Lab exercise on Cryptography. * When totally complete, you will be requested to take a survey regarding the effectiveness of performing cryptography by hand versus by software. If you take this survey, regardless of your responses, you will be awarded 10 extra credit points. The survey will be made available to you no later than noon on Monday, December 1. It will be open until Monday, December 8, at noon. All percentages below are in terms of percentage of the 60 points for the assignment ITEM (by Hand) | Value | ITEM (CrypTool1) | Value | RSA | 15% | RSA | 15% | Vernam | 5% | Vigenere | 10% | Vigenere | 5% | XOR | 10% | XOR | 5% | | | | Using Virtual Cloud Lab | | | | Files from Virtual Lab | 10% | | | Answers to each question | 5% or 25% | | | I. Cryptography By Hand The first question uses the concepts of the RSA Algorithm to encrypt a message. You are not required to determine the public key and the private key, these will be given to you (the derivation is provided online). You will be......

Words: 1748 - Pages: 7

Free Essay

...CS 6903 - Applied Cryptography Lecture 10: Lecture 10, slides 3-15 Speaker: Giovanni Di Crescenzo, Scribe: Chaitanya Bhorade December 13, 2014 Summary: This document contains notes for Lecture 10, slides 3-15. These are the lecture notes with some additional information by the scribe, for Lecture 10 Slides 3- 15. The primary focus is on Digital Signatures and its constructions. Properties of a digital signature is then discussed. This is followed by some Digital Signature schemes. And ﬁnally Digital Signatures in practice are shown to conclude the notes. 1 Introduction Digital Signatures is a concept derived form a normal signature which is used to conﬁrm the origin of a received document. Asymmetric cryptographic technique is been implemented to ensure whether the received document is authenticated or not. With some factors, a digital signature oﬀers more security than a real-life signature. Because it is diﬃcult to convert a digital signature for message m which can be used as a sign a new message m’ A digital signature for a document would be bits which are derived from: the document and the secret key of the signer.The public key is available freely to anyone who wants to verify the signature. Whereas the other key, which is a secret key, is only known to the one that is authorized to generate the signatures which are associated with that public key. 2 Properties of Digital Signature • Integrity: Recipients can be conﬁdent that the message has not......

Words: 1535 - Pages: 7

Free Essay

...[2] C. Blundo, A. De Santis, and D.R. Stinson. On the contrast in visual cryptography schemes. J. Cryptogr., 12:261-289, 1999. [3] J. B. Feng, H. C. Wu, C. S. Tsai, Y. F. Chang, and Y. P. Chu. Visual secret sharing for multiple secrets. Pattern Recognition, 41:3572-3581, 2008. [4] A. Ross and A. A. Othman, “Visual Cryptography for Biometric privacy”, IEEE Transaction on Information Forensics and Security, vol. 6, no. 1, Mar.2011. [5] M. Naor and B A. Shamir. Visual cryptography. in: A. De San tis (Ed.), Advances in Cryptology: Eurpocrypt'94, Lecture Notes in Computer Science, 950: 1-12, 1995. [6] C.C. Wu and L.H. Chen. A study on visual cryptography, Master Thesis. PhD thesis, Institute of Computer and Information Science, National Chiao Tung University, Taiwan, R.O.C., 1998. [7] M. Naor and A. Shamir “Visual cryptography:Improving the contrast via the cover base” IACR Eprint archive, 1996. [8] C. Blundo and A. De Santis and D.R. Stinson, “On the contrast in visual cryptography schemes”, Jurnal pf cryptography, vol. 12, pp. 261-289, 1996. [9] G. Ateniese and C. Blundo and A. De Santis and D.R. Stinson,“Extended Schemes for Visual Cryptography”, Theoretical Computer Science, 1996. [10] Z. Zhouand and G. R. Arce and G. Di Crescenzo, “Halftone visual cryptography” IEEE Trans. Image Process, vol. 15, no. 8, pp. 2441-2453, Aug. 2006. [11] C. Blundo and A. De Santis and M. Naor, “Visual cryptography for grey level image”, Information Processing Letters, vol. 75, pp.......

Words: 715 - Pages: 3

Premium Essay

...Cryptograpy Exam 1. What are some threats associated with a direct digital signature scheme? a. The scheme validation is dependent on the security of the sender’s private key, which the sender can later claim lost or stolen and that the signature was forged when trying to deny sending a particular message. b. If a private key is stolen from Bob at time t, the thief can send a message signed with Bob’s signature with a time stamp equal to or less than t. c. The need for trust between 2 participants is a potential threat since there is no independent verification process. 2. How can you get physical possession of the password hashes from a MS Server 2008 running Active Directory? a. To obtain hashes from a MS Server 2008, the system has to be compromised; domain hashes are stored in Active Directory on domain controllers while local account hashes are stored in the local SAM database. For member servers and workstations, a domain account’s password hashes can only be stored on systems where the user has performed an interactive logon. When an interactive logon occurs, the domain account's password hash will be stored on disk in the form of a cached-credentials hash. b. I also need to have administrative rights on the compromised system, the tools required to retrieve domain password hashes, all require admin rights on a running systems. Some tools need to be able to elevate local SYSTEM privileges in order to access protected Registry files, while others work by......

Words: 338 - Pages: 2

Free Essay

...EC6020 – ARSITEKTUR KOMPUTER LANJUT TUGAS – 4 CHAPTER 5 BUS, CACHE AND SHARED MEMORY SOAL-SOAL TENTANG ORGANISASI-ORGANISASI CACHE MEMORY (CACHE MEMORY ORGANIZATIONS) ARWIN NIM. 232 06 008 MAGISTER TEKNIK ELEKTRO SEKOLAH TINGGI ELEKTRONIKA DAN INFORMATIKA INSTITUT TEKNOLOGI BANDUNG 2006 1 Problem 5.8 – The main memory of a computer is organized as 64 blocks with a block size of eight (8) words. The cache has eight (8) block frames. In parts (a) through (d), show the mapping from the numbered blocks in main memory to the block frames in the cache. Draw all lines showing the mappings as clearly as possible. a. Show the direct mapping and the address bits that identify the tag field, the block number, and the word number. b. Show the fully associative mapping and the address bits that identify the tag field and the word number. c. Show the two-way set-associativity mapping and the address bits that identify the tag field, the set number, and the word number. d. Show the sector mapping with four blocks per sector and the address bits that identify the sector number, the block number, and the word number Answer : From the above statement, we get the memory and cache configuration information to calculate the identification bits and the addressing scheme. They are : Main memory has 64 blocks → n = 64 Cache memory has 8 block frames → Block size is 8 words → b = 8 ↔ s = 6 because n = 2 s m = 8 ↔ r = 3 because m = 2r ↔ w = 3......

Words: 1195 - Pages: 5