- •Основы письменной коммуникации в профессиональной деятельности в иноязычной среде
- •Самара 2012
- •Введение
- •Часть 1. Особенности научного стиля: лексические и фразеологические средства, разновидности и жанры Особенности научного стиля
- •Лексические средства научного стиля
- •Фразеологические средства научного стиля
- •Разновидности и жанры научного стиля
- •Компрессия текста и основные виды компрессии текста
- •Аннотация: понятие, функции, структура, характеристики
- •Основные характеристики аннотации:
- •Фразы, рекомендуемые для написания аннотации к научной статье:
- •Резюме: понятие, характеристики, план написания
- •Существует несколько обязательных характеристик хорошего резюме:
- •Пошаговый план написания резюме:
- •Рецензия: понятие и структура
- •Рецензия должна включать в себя следующую информацию:
- •Фразы, рекомендуемые для написания рецензии на научную статью:
- •Образцы компрессии текстов Аннотация статьи «Особенности самоконтроля младших школьников как универсального учебного действия»
- •Резюме статьи «Особенности самоконтроля младших школьников как универсального учебного действия»
- •Рецензия на статью «Особенности самоконтроля младших школьников как универсального учебного действия»
- •Часть 2. Практические задания Texte 1. What is a computer?
- •Texte 2. Basic features of database programs
- •Texte 3. Programming
- •Texte 4. Completely electronic device
- •Texte 5. Word-processing facilities
- •Internet software
- •Irc, audio and video chatting
- •Texte 6. Cryptography
- •1. Basic Terminology
- •2. Basic Cryptographic Algorithms
- •Texte 7. Hardware and software
- •Texte 8. Apple macintosh computers
- •Texte 9. Artificial intelligence
- •Texte 10. What is physics?
- •Texte 11. What are fuel cells?
- •Texte 12. How do solar cells work?
- •Texte 13. Mathematics as a science
- •Texte 14. Fields of mathematics
- •Texte 15. Mathematical beauty
- •Article 1. Mr-Radix: a multi-relational data mining algorithm
- •Introduction
- •Article 2. A survey of black hole attacks in wireless mobile ad hoc networks
- •1. Introduction
- •2. Background
- •2.1. Proactive (table-driven) Routing Protocol
- •2.2. Reactive (on-demand) Routing Protocol
- •2.3. Hybrid Routing Protocol
- •3. Single Black Hole Attack
- •3.1. Neighborhood-based and Routing Recovery Scheme [26]
- •3.2. Redundant Route Method and Unique Sequence Number Scheme [27]
- •3.3. Time-based Threshold Detection Scheme [28]
- •3.4. Random Two-hop ack and Bayesian Detection Scheme [29]
- •3.5. Resource-Efficient aCcounTability (reAct) Scheme based on Random Audits [30]
- •3.6. Detection, Prevention and Reactive aodv (dpraodv) Scheme [31]
- •3.7. Next Hop Information Scheme [32]
- •3.8. Nital Mistry et al.'s Method [33]
- •3.9. Intrusion Detection System based on Anti-black hole mechanism [34]
- •4. Collaborative Black Hole Attack
- •4.1. Dri Table and Cross Checking Scheme [36, 37]
- •4.2. Distributed Cooperative Mechanism (dcm) [38]
- •4.3. Hash based Scheme [39]
- •4.4. Hashed-based mac and Hash-based prf Scheme [40]
- •4.5. Backbone Nodes (bbn) and Restricted ip (rip) Scheme [41]
- •4.6. Bait dsr (bdsr) based on Hybrid Routing Scheme [43]
- •5. Conclusions and Future Works
- •Article 3. Quantum social networks
- •Introduction
- •1.2. Summary lead
- •2. Positive comments
- •3. Criticism and objections
- •4. Data analysis
- •5. Results and their representation
- •6. Conclusion
- •7. Prospects and applications
- •Appendix 2. Sample annotations
- •Appendix 3. Sample text with annotation
- •Appendix 4. Some tips on summary writing
- •Appendix 5. Some tips on review writing
- •I. Характеристика и описание работы
- •II. Структура работы. Характеристика построения книги и ее разделов
- •III. Вводная часть. Историческая справка. Выходные данные
- •IV. Основные достоинства и недостатки работы
- •1. Достоинства
- •2. Недостатки. Замечания
- •V. Оценка работы, рекомендации. Заключение
- •Sample review
- •Appendix 6. Spelling and punctuation Особенности орфографии английского языка
- •Литература
- •Научные журналы в электронном формате:
- •Содержание
- •Часть 1. Особенности научного стиля: лексические и фразеологические средства, разновидности и жанры 6
- •Часть 2. Практические задания 20
- •Основы письменной коммуникации в профессиональной деятельности в иноязычной среде
- •(Направление подготовки: 050100.62 «Педагогическое образование»; профили подготовки: «Математика и информатика», «Физика и информатика»)
Texte 6. Cryptography
Cryptography is no longer a military thing that should not be messed with. It is time to demystify cryptography and make full use of the advantages it provides for the modem society. In the following, basic terminology and the main methods of cryptography are presented. Any options and evaluations presented here are speculative, and the author cannot be held responsible for their correctness.
1. Basic Terminology
Suppose that someone wants to send a message to a receiver, and wants to be sure that no one else can read the message. However, there is the possibility that someone else opens the letter or hears the electronic communication. In cryptographic terminology, the message is called plaintext or cleartext. Encoding the contents of the message in such a way that hides its contents from outsiders is called encryption. The encrypted message is called the ciphertext. The process of retrieving the plaintext from the ciphertext is called decryption. Encryption and decryption usually make use of a key, and the coding method is such that decryption can be performed only by knowing the proper key.
Cryptography is the art or science of keeping messages secret. Cryptanalysis is the art of breaking ciphers, i.e. retrieving the plaintext without knowing the proper key. People who do cryptography are cryptographers, and practitioners of cryptanalysis are cryptanalysts.
Cryptography deals with all aspects of secure messaging, authentication, digital signatures, electronic money, and other applications. Cryptology is the branch of mathematics that studies the mathematical foundations of cryptographic methods.
2. Basic Cryptographic Algorithms
A method of encryption and decryption is called a cipher. Some cryptographic methods rely on the secrecy of the algorithms; such algorithms are only of historical interest and are not adequate for real-world needs. All modern algorithms use a key to control encryption and decryption; a message can be decrypted only if the key matches the encryption key. The key used for decryption can be different from the encryption key, but for most algorithms they are the same. There are two classes of key-based algorithms, symmetric (or secret-key) and asymmetric (or public-key) algorithms. The difference is that symmetric algorithms use the same key for encryption and decryption (or the decryption key is easily derived from the encryption key), whereas asymmetric algorithms use a different key for encryption and encryption, and the decryption key cannot be derived from the encryption key.
Symmetric algorithms can be divided into stream ciphers and block ciphers. Stream ciphers can encrypt a single bit of plaintext at a time, whereas block ciphers take a number of bits (typically 64 bits in modem ciphers), and encrypt them as a single unit.
Asymmetric ciphers (also called public-key algorithms or generally public-key cryptography) permit the encryption key to be public (it can be published in a newspaper), allowing anyone to encrypt with the key, whereas only the proper recipient (who knows the decryption key) can decrypt the message. The encryption key is also called the public key and the decryption key – the private key or secret key.
Modern cryptographic algorithms cannot really be executed by humans. Strong cryptographic algorithms are designed to be executed by computers or specialized hardware devices. In most applications, cryptography is done in computer software.
Generally, symmetric algorithms are much faster to execute on a computer than asymmetric ones. In practice they are often used together, so that a public-key algorithm is used to encrypt a randomly generated encryption key, and the random key is used to encrypt the actual message using a symmetric algorithm.
Read the text.
Pick up the key words.
Divide the text into logical parts.
Make up an outline of the text.
Find the main idea in each part of the text.
Express the main idea of each part in one sentence.
Find supporting details in each part of the text.
Compress the text excluding the supporting details.
Express the main idea of the text in one sentence.
Write an annotation/a summary of the text using words and word combinations from your active vocabulary and sample summaries.
