web transactions
Recently Published Documents


TOTAL DOCUMENTS

42
(FIVE YEARS 3)

H-INDEX

7
(FIVE YEARS 1)

This chapter highlighted the differences of users' behaviors between native English-speaking users and Chinese users as the biggest example of non-native English-speaking users. To do as such, the author of this chapter began by discussing the background of earlier web usage studies followed by a literature review on comparative studies that are on the basis of users with different language preferences. Afterwards, since earlier web log analyses are based on web transactions collected from mainly native users, the author of this chapter investigated the feasibility of generalization of former findings for navigational searching to the rest of the users by comparing two web log transactions from two groups of users with different localities in respect to the state-of-the-art in web searching.


Author(s):  
Mehwish Akram ◽  
William C Barker ◽  
Rob Clatterbuck ◽  
Donna Dodson ◽  
Brandon Everhart ◽  
...  

The internet is a very powerful and useful tool for communication, information and connectivity. So it is very important to keep yourself safe and secure online. The best way of secure information is encryption; there are many cryptographic algorithms available for encryption. These cryptographic algorithms are classified according to their encrypting process; as substitution cipher or transposition cipher. In Polyalphabetic ciphers, the substitution rule changes continuously from character to character according to the keyword and plaintext. Vigenere cipher is considered to be the most efficient Polyalphabetic substitution cipher. But it is vulnerable to attacks, due to its repeating nature of the keyword. To overcome this vulnerability, here we are presenting a new Polyalphabetic substitution scheme which uses infinite number of 26 x 26 random tables for encryption. During encryption, whenever the keyword repeats, this proposed Polyalphabetic substitution cipher generates a 26 x 26 alphabetical random table. Instead of using the same Vigenere Table here we are using an infinite number of alphabetical tables depending on the length of the plaintext and keyword. Each random table will be completely independent from the previous table. This will reduces the repeating sequences in the ciphertext. The repeating nature of the keyword does not help the crackers to break this code. So this proposed Polyalphabetic substitution cipher is considered as an unbreakable cryptosystem. The Proposed Polyalphabetic cipher can provide security for many applications such as web transactions, web transactions, personal emails, secret information transmitted between public or private organization, military application etc.


2018 ◽  
pp. 4681-4682
Author(s):  
Heiko Schuldt
Keyword(s):  

Author(s):  
Heiko Schuldt
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document