Nazeer Chaudhry Independent Researcher Pakistan
Nazeer Chaudhry has offered 1st decryption of Indus Scripts 1300 BC civilization in South Asia. As President TPI Inc, board of 30 has offered predicted solutions to over 0.5 million problems. Crackiing codes of terrorists and corruption mafia took about 50 years and suffered over dozen killing attacks being only male member of few properties.All of his relatives were killed by relatives of his step mother who had been brought up , educated and services/ every thing given by him and his father. Global Peace Mega Project and other petiotions at Nazeer ChaudhryTwitter : and Nazeer Ahmad Chaudhry at Peace Pink page has the details.
Comment
-
Comment by nazeer ahmad chaudhry on January 9, 2013 at 1:44am
-
“Bones, cow dung and such like stuff is food for Jinns ( Jenies ) ; creatures produced from fire hence avoid urinating on the dumps of garbage. Mark never walked after his youth when fairy or jennie or evil spirit fell in love with him”, Raja A Bhatti told the story of his cousin. Last month he started walking telling that his lover fairy has died though they have much longer life. Last week matured Advocate G Bhatti brother in law of Raja A Bhatti told that fire creature have 10 time more population as compared with humen beings. Nizirian from nearby village got late while working in the fields while others had gone. She was carrying bunddle of fodder on her head and it was not possible to travel further in dark night. She climed the tree and concealed her . After midnight , marriage ceremony of Jinns under the tree had started. Some Jinn sent her the food on a big leave of the tree. Same thing had happened to our porter Reman while crossing the stream at late night , he watched marriage of ginns . Food given to him on a big leave of tree was dung and bones that was given to him.
-
-
“Bones, cow dung and such like stuff is food for Jinns ( Jenies ) ; creatures produced from fire hence avoid urinating on the dumps of garbage. Mark never walked after his youth when fairy or jennie or evil spirit fell in love with him”, Raja A Bhatti told the story of his cousin. Last month he started walking telling that his lover fairy has died though they have much longer life. Last week matured Advocate G Bhatti brother in law of Raja A Bhatti told that fire creature have 10 time more population as compared with humen beings. Nizirian from nearby village got late while working in the fields while others had gone. She was carrying bunddle of fodder on her head and it was not possible to travel further in dark night. She climed the tree and concealed her . After midnight , marriage ceremony of Jinns under the tree had started. Some Jinn sent her the food on a big leave of the tree. Same thing had happened to our porter Reman while crossing the stream at late night , he watched marriage of ginns . Food given to him on a big leave of tree was dung and bones that was given to him.
-
-
Look at the beauty of the cipher that gives B as the name or 1 as the number . Zona my DVP might be assumed on truth machine give the hand signal and my AVP Sony to be assumed as expert on calling the spirits and giving the eye movement signals. The movement of tongue and lips was our cipher language. Why all this nonsense was generated by Doctor &Mona, Mula &Rosy , Ahmad &Julia, Professor &Sara, Nazeer & Hala, Tony & Jane , Chaudhry& Sonia , Bhatti & Sohn and Mac &Eva .Just count the persons . Eva record them 10 and including Mark , Sony and Zona ,our class had 13 students. Zona has the same problem
-
-
TPI Control Desk
Eva nick name Black Beauty may be assumed as PS to Mac. President TPI Inc. an agency that had given 0.3 million solutions to all types of problems at local and global level since 1989. Eva may also be assumed as VP TPI Control Desk having film of the past , present and future. My father had left my mother and grew up as VIP Car-1 in my street according to unbreakable spoken cipher system evolved by Mac as a kid . Mac was our school administrator and I thought him to be his best friend because I always reserved his seat just in front of the door at my left on the jute bag brought by me or Sonia sitting at his right side . Sonia nickname Blue Bird was VP Blue Land Desk registered as VIP Car-1 in her street. Julia nick name Blue Bolt was VP Fox-land desk on east side . Sara VP nick name Black Bird VP Umpire Desk registered as VIP Car-1 in her street sat on Southern side. The center of North wall was reserved for Hala nick name Brown Beauty our SVP European Union registered as VIP Car-1 in her street. This was a war gaming model for solution of any problem based on the learning from 60 of W.W.I and W.W.II.
-
-
Introduction
Please modify , correct & edit the draft , We failed to fnd proper English name for ‘Phisi’ or ‘do -mouni” in local language . Arm length cobra type snake having mouth at each end calleed “do” meaning two “mouni” meaning ‘mouth’ termed as piosnous “ phisi” though it is not. She put a firm grip with one mouth and bites with other . We traved last week to Daulala to huts of snake charmer on the news of having Boa with 2 mouth but we detect only one mouth. Hamida, Babu, Hamid , Sadiq, Zebun and many others confirmed 2 mouth snakes.
-
-
Cracking of 1st Script of Harappan Script
Engineer Nazeer.Ahmad. Chaudhry Author : Mac President TPI Inc. Editors ; Eva, Sony , Zona ,
-
-
Shannon assures us that systems are breakable with sufficient ciphertext, but also introduces the concept of "workload", which embodies the difficulty in determining plaintext from ciphertext given the availability of enough ciphertext to theoretically break the system. An alternative to increasing unicity distance is the use of systems that tend to increase the workload required to determine solutions to cryptograms. Two important concepts due to Shannon's paper are the "diffusion" and "confusion" properties. These form the basis for many modern cryptosystems because they tend to increase the workload of cryptanalysis
-
-
The first line of exploration is to reduce the redundancy of the language to extend the length of ciphertext required for solution. From Shannon's equation, we see that as the content of a message approaches its actual length, the divisor goes to 0, and thus the length of ciphertext required to determine the plaintext goes to infinity. Data compression techniques [Huffman52] may be practically used to remove 99.9% of the redundancy of plaintext with a reasonable degree of efficiency, and we can thus easily generate systems in which the unicity distance goes to |K|/|M|*0.001 which is 1 when |M|=1000*|K|. For a key of 64 bits in length, we could expect to safely encipher up to 64,000 bits of information, or about 8 pages of double spaced text before the system becomes theoretically breakable. We could easily replace a 64 bit key every 4 pages of text to make breaking the system nearly impossible, assuming we can store and distribute a sequence of truly random keys.
-
-
The transmission of symmetric-key encryptions is safe provided that nobody besides the sender and intended receiver obtains the key. However, the problem in security arises from the difficulty of securely transferring the key so that those receiving the encrypted message are able to decrypt it. Asymmetric keys minimize this problem because a public-key cryptosystem uses a pair of keys—a private key that remains with the encryptor, and a public key that is openly available to all users, thus eliminating the need to transfer a key in secrecy.
In 1948, Shannon published "A Communications Theory of Secrecy Systems" [Shannon49] . Shannon was one of the first modern cryptographers to attribute advanced mathematical techniques to the science of ciphers. Although the use of frequency analysis for solving substitution ciphers was begun many years earlier, Shannon's analysis demonstrates several important features of the statistical nature of language that make the solution to nearly all previous ciphers very straight forward. Perhaps the most important result of Shannon's famous paper is the development of a measure of cryptographic strength called the 'unicity distance'.
The unicity distance is a number that indicates the quantity of ciphertext required in order to uniquely determine the plaintext of a message. It is a function of the length of the key used to encipher the message and the statistical nature of the plaintext language. Given enough time, it is guaranteed that any cipher can be broken given a length of ciphertext such that the unicity distance is 1. The unicity distance is computed as:
H(K)/(|M|-H(M))
where H(K) is the information content [Shannon48] of the key, H(M) is the information content per symbol of the message, and |M| is the information content per symbol of the message assuming that all symbols are equally likely. If K is chosen at random, H(K)=|K|, so for randomly chosen letters in English, H(K)=|K|=log2(26)=4.7 bits. For a 26 letter alphabet, |M|=4.7 bits. After a lot of statistical analysis of text, H(M) was imperically found to be 2.9 bits for English, and thus the unicity distance for English is 1 when |M| is (4.7/1.8)*|K|. In other words, any time the length of all messages sent under a particular key in English exceeds 2.6 times the length of that key, the key and plaintext can eventually be determined.
Shannon noted that in a system with an infinite length random key, the unicity distance is infinite, and that for any alphabetic substitution cipher with a random key of length greater than or equal to the length of the message, plaintext cannot be derived from ciphertext alone. This type of cipher is called a "one-time-pad", because of the use of pads of paper to implement it in WW2 and before.
The story of cryptography would be at an end if it weren't for the practical problem that in order to send a secret message, an equal amount of secret key must first be sent. This problem is not severe in some cases, and it is apparently used in the hot line between Moscow and Washington [Kahn67] , but it is not the ultimate solution for many practical situations.
For most human (and computer) languages, a key of a given length can only be guaranteed safe for 2-3 times the length of the key. From this analysis, it appears that any system with a finite key is doomed to failure, but several issues remain to be resolved before all hope for finite key cryptography is abandoned. By looking at Shannon's equation, we may find ways out of our delema.
-
-
Evolution of Ethno-Archaeological Model Introduction to Cryptanalysis (p 1-24)
Evolution of Cryptanalysis Algorithm (p 127-191)Encryption and Security
Most encryption involves a key and a set of steps or a procedure known as an algorithm . The key is an item of information used repeatedly in the algorithm while the message (called plaintext, even if it is sound or pictures) is being encrypted. The key customizes the algorithm. It is used with the algorithm for encoding and again later for decoding an entire message. If one knows the algorithm and the key, retrieving the plaintext from an encoded message is easy.
Encryption systems fall into one of two main categories. In symmetrickey encryption, the key is the same for the encryption of the message as for the decryption: that is, both the encoder and the decoder know and use the same key. In asymmetric or "public-key" encryption, the key provided to the decoder is not the same as the encoder's key.
About
© 2025 Created by Soleilmavis.
Powered by
You need to be a member of The Queen of The South to add comments!
Join The Queen of The South