-
1 Challenge Handshake Authentication Protocol
A challenge-response authentication protocol for Point-to-Point Protocol (PPP) connections described in RFC 1994. It uses the industry-standard MD5 hashing algorithm to hash the combination of a challenge string issued by the authenticating server and the user's password in the response."بروتوكول ""Challenge Handshake Authentication Protocol"""English-Arabic terms dictionary > Challenge Handshake Authentication Protocol
-
2 CHAP
A challenge-response authentication protocol for Point-to-Point Protocol (PPP) connections described in RFC 1994. It uses the industry-standard MD5 hashing algorithm to hash the combination of a challenge string issued by the authenticating server and the user's password in the response. -
3 encryption key
A bit string that is used in conjunction with an encryption algorithm to encrypt and decrypt data. -
4 data encryption key
A bit string that is used in conjunction with an encryption algorithm to encrypt and decrypt data. -
5 DEK
A bit string that is used in conjunction with an encryption algorithm to encrypt and decrypt data.
См. также в других словарях:
String searching algorithm — String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text. Let Σ be… … Wikipedia
String metric — String metrics (also known as similarity metrics) are a class of textual based metrics resulting in a similarity or dissimilarity (distance) score between two pairs of text strings for approximate matching or comparison and in fuzzy string… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
String — Wiktionarypar|stringGenerally, string is a thin, flexible piece of rope or twine which is used to tie, bind, or hang other objects. String can be made from a variety of fibres.Examples of string use include: * String figures, designs formed by… … Wikipedia
String-to-string correction problem — Citation enhancement. Please you see. Any concerns? Please . The string to string correction problem refers to the minimum number of editoperations necessary to change one string into another. A single editoperation may be changing a single… … Wikipedia
String-Matching-Algorithmus — Dieser Artikel wurde aufgrund von inhaltlichen Mängeln auf der Qualitätssicherungsseite der Redaktion Informatik eingetragen. Dies geschieht, um die Qualität der Artikel aus dem Themengebiet Informatik auf ein akzeptables Niveau zu bringen. Hilf… … Deutsch Wikipedia
Karplus-Strong string synthesis — is a method of physical modelling synthesis that loops a short waveform through a filtered delay line to simulate the sound of a hammered or plucked string or some types of percussion.Although it is useful to view this as a subtractive synthesis… … Wikipedia
Comparison of programming languages (string functions) — String functions redirects here. For string functions in formal language theory, see String operations. Programming language comparisons General comparison Basic syntax Basic instructions Arrays … Wikipedia
Knuth–Morris–Pratt algorithm — The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a word W within a main text string S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to… … Wikipedia
Boyer–Moore string search algorithm — The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… … Wikipedia
