A Mathematical Model for Human Flesh Search Engine

2012 ◽  
pp. 187-198 ◽  
Author(s):  
Lei Zhang ◽  
Yuankang Liu ◽  
Juanzi Li
Keyword(s):  
Mathematical Model ◽  
Search Engine ◽  
Human Flesh ◽  
Human Flesh Search Engine

Human Flesh Search Engine and Online Privacy

2015 ◽  
Vol 22 (2) ◽  
pp. 601-604 ◽  
Author(s):  
Yang Zhang ◽  
Hong Gao
Keyword(s):  
Search Engine ◽  
Online Privacy ◽  
Human Flesh ◽  
Human Flesh Search Engine

A Study of the Human Flesh Search Engine: Crowd-Powered Expansion of Online Knowledge

Computer ◽  
2010 ◽  
Vol 43 (8) ◽  
pp. 45-53 ◽  
Author(s):  
Fei-Yue Wang ◽  
Daniel Zeng ◽  
James A. Hendler ◽  
Qingpeng Zhang ◽  
Zhuo Feng ◽  
...  
Keyword(s):  
Search Engine ◽  
Human Flesh ◽  
Human Flesh Search Engine

A critical discourse analysis of the human flesh search engine

Media Asia ◽  
2019 ◽  
Vol 46 (1-2) ◽  
pp. 18-34 ◽  
Author(s):  
Undrah B. Baasanjav ◽  
Jan Fernback ◽  
Xiaoyan Pan
Keyword(s):  
Discourse Analysis ◽  
Critical Discourse Analysis ◽  
Search Engine ◽  
Critical Discourse ◽  
Human Flesh ◽  
Human Flesh Search Engine

scholarly journals Competition In Search Engine Market

1970 ◽  
Vol 28 (2) ◽  
pp. 123-150
Author(s):  
Edison Tse ◽  
Wugang Zhao
Keyword(s):  
Mathematical Model ◽  
Search Engine ◽  
Market Share ◽  
Industry Structure ◽  
Asian Countries ◽  
Western Countries ◽  
The Us ◽  
General Search ◽  
Leading Position ◽  
Search Market

Google has been very successful in becoming the dominant search engine platformin the US and Western countries. In contrast to its success in the US and Westerncountries, Google does not have much luck in some Asian countries such as Chinaand Korea. Google is far behind in terms of search market share in China and Korea.In this paper, we model the search engine market as a two-sided markets model andanalyze the industry structure and competition of the search engine market. First, wepresent a mathematical model for a general search engine two-sided market. Then weuse the model to analyze the search engine history and explain why multiple searchengines could co-exist in the early days of the search engine history. We also explainhow Google, a latecomer in the search market, could become the leading search engine,and how Google has strengthened its leading position. Next we apply the modelto China and Korea’s search markets and analyze how Google could lose the game tolocal search companies. In the end, we propose some strategies on how search enginemarket leaders could maintain and strengthen their leading positions.

Attacks on the Random Gamming Code

2020 ◽  
pp. 35-58
Author(s):  
A. V. Babash
Keyword(s):  
Mathematical Model ◽  
Search Engine ◽  
Main Idea ◽  
Practical Relevance ◽  
Encryption Scheme ◽  
Similar Concept ◽  
Perfect Secrecy ◽  
Definition Of ◽  
The Mathematical Model ◽  
The Relationship

In 1917, Hilbert Vernam patented a top-secret encryption scheme, which at first was called a one-time notepad and later a Vernam cipher. At the time that Vernam proposed this scheme, there was no evidence that it was completely secret, since, in fact, at that time yet there was no idea what the perfect secret of the cipher was. However, about 25 years later, Claude Shannon introduced the definition of perfect secrecy (perfect cipher) and demonstrated that the random gamming cipher reaches this level of security. Cryptographers believe that there are no effective attacks for attacks of random gamming. In particular, there are no effective attacks for the Vernam cipher.Objective: to justify the fallacy of this proposition to build effective attacks.Methods: analysis of the relationship between the cipher key and the received encrypted text.Results: an attack on the plaintext of a random gamming cipher based on a given encrypted text was developed. In addition, there was a suggestion for another attack on the plaintext contents based on the encrypted text. For all attacks, parameters of their complexity are calculated. These results are new. Previously, an attack on the random gamma code was unavailable. The results disprove the opinion that there are no attacks on this cipher.Practical relevance: firstly, it has become possible to carry out attacks on the random gamming code. Secondly, when using this cipher, it is necessary to strictly limit the length of the message.Discussion: the idea that there is an effective attack on a random gamming cipher arose in 2002, due to the possibility of introducing a similar concept, in which in a definition of the perfect cipher the plaintext is changed for a key. The first idea in creating attacks is that when the key is long its elements are repeated. The second idea is that attacks on two plaintexts are encrypted with one key. And the main idea was that it is necessary to improve the mathematical model of the Shannon code. Therein, when interpreting the concept of the perfect cipher, we should talk about the cipher model perfection.The publication place: in the Yandex search engine a query "Perfect ciphers" resulted in 22 million links, on a query "schemes perfectly secret" there were 43 million links. Yandex on the query "random gamming code" gave 13 million results.

Sign in / Sign up

Export Citation Format

Share Document