security, Computer Engineering

Assignment Help:
We now consider the relation between passwords and key size. For this purpose
consider a cryptosystem where the user enters a key in the form of a password.
Assume a password consisting of 8 letters, where each letter is encoded by the
ASCII scheme (7 bits per character, i.e., 128 possible characters). What is the
size of the key space which can be constructed by such passwords?
What is the corresponding key length in bits?
Assume that most users use only the 26 lowercase letters from the alphabet in-
stead of the full 7 bits of the ASCII-encoding. What is the corresponding key
length in bits in this case?
At least how many characters are required for a password in order to generate a
ey length of 128 bits in case of letters consisting of
a. 7-bit characters?
b. 26 lowercase letters from the alphabet?

Related Discussions:- security

What is effective address, Q. What is Effective Address ? The symbol EA...

Q. What is Effective Address ? The symbol EA (Effective Address) refers to a physical address in a non-virtual memory environment and refers to a register in a virtual memory a

Write miss policy - cache memories, WRITE MISS POLICY:   Write allo...

WRITE MISS POLICY:   Write allocate   fetch on write   fetch entire block, then write word into block   allocate a new block on each writ   allocate block, but

Typicality of virtual addresses, The typicality of virtual addresses is tha...

The typicality of virtual addresses is that: They are longer than physical addresses because total addressed memory in virtual memory is more than actual physical memory.

Why array index starts from zero, This boils down to the concept of Binary ...

This boils down to the concept of Binary digits. Take an array size of 64 for example. We begin from 0 and end at 63. We need 6 bits.But, if we were to begin from 1 and end at 64,

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

What is a snooping cache, DNS cache snooping is not a term the author just ...

DNS cache snooping is not a term the author just made up, it is called and discussed by some notable DNS execution developers, and a few interested DNS administrators have prob

Explain yet another compiler-compiler, Explain Yet another Compiler-Compile...

Explain Yet another Compiler-Compiler. YACC uses for "Yet another Compiler-Compiler": Computer program input usually has some structure; actually, all computer programs which

Explain tree, Tree (recursive definition) A tree is a finite set of one...

Tree (recursive definition) A tree is a finite set of one or more than one nodes such that. (1) There is a specially designated node known as the root. (2) The left over

What is an avl tree, What is an AVL tree? AVL Tree An AVL tree is...

What is an AVL tree? AVL Tree An AVL tree is a binary tree in which the dissimilarity in heights among the left and the right subtree is not more than one for each node.

And-elimination-introduction rule - artificial intelligence, And-Eliminatio...

And-Elimination-Introduction rule - Artificial intelligence: And-Elimination In English, this says that "if you know that many things are all true, then you know that any

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd