Cryptographic algorithms Cryptographic algorithms Bach's algorithm is an efficient algorithm for generating random factored numbers. Bach's algorithm is named after its discoverer, Eric Bach. The alrogithm is of interest because the straightforward method for generating a random factored number, namely generating a random number and then factoring it, is not known to be efficient, because no algorithm is known that efficiently factors numbers. Bach's algorithm is capable of generating random numbers along with their factorization efficiently. ...more on Wikipedia about "Bach's algorithm"
In cryptography, a block cipher operates on blocks of fixed length, often 64 or 128 bits. To encrypt longer messages, several modes of operation may be used. The earliest modes described, such as ECB, CBC, OFB and CFB provide only confidentiality, and this does not ensure message integrity. Other modes have been designed which ensure both confidentiality and message integrity, such as CCM mode, EAX mode and OCB mode. Tweakable narrow-block encryption (LRW) mode and wide-block encryption (CMC and EME) modes, designed to securely encrypt sectors of a disk, are described in the article devoted to disk encryption. ...more on Wikipedia about "Block cipher modes of operation"
In cryptography, ciphertext stealing (CTS) is a general method of using a block cipher mode of operation that allows for processing of messages that are not evenly divisible into blocks without resulting in any expansion of the ciphertext, at the cost of significantly increased complexity. ...more on Wikipedia about "Ciphertext stealing"
The Common Scrambling Algorithm (or CSA) is the encryption algorithm used in the DVB digital television broadcasting for encrypting video streams. ...more on Wikipedia about "Common Scrambling Algorithm"
A cryptographically secure pseudo-random number generator (CSPRNG) is a pseudo-random number generator (PRNG) with properties that make it suitable for use in cryptography. ...more on Wikipedia about "Cryptographically secure pseudorandom number generator"
The D'Agapeyeff cipher is an as-yet unbroken cipher that appears in the first edition of Codes and Ciphers, an elementary book on cryptography published by the Russian-born English cartographer Alexander D'Agapeyeff in 1939 . ...more on Wikipedia about "D'Agapeyeff cipher"
In computer science, a hash list can mean any kind of list of hashes. Lists of hashes are used for many different purposes such as fast table lookup ( hash tables) and distributed databases ( distributed hash tables). This article is about the kind of hash lists that are used to guarantee data integrity. ...more on Wikipedia about "Hash list"
shortopedia - Xtending Info.
In computer science, hash trees, also known as Merkle (hash) trees or Tiger tree hashes, are an extension of the simpler concept hash list, which in turn is an extension of the old concept of hashing, for instance, a file, by running it through a mathematical formula and producing a nearly unique, but much smaller, string to represent it. The same file can then be checked later, and if it doesn't produce the same string it must have been changed. ...more on Wikipedia about "Hash tree"
A linear feedback shift register (LFSR) (sometimes called PN Sequences register) is a shift register whose input is the exclusive-or (xor) of some of its outputs. ...more on Wikipedia about "Linear feedback shift register"
Modular exponentiation is a type of exponentiation performed over a modulus. It is particularly useful in computer science, especially in the field of cryptography. ...more on Wikipedia about "Modular exponentiation"
Montgomery reduction is an algorithm introduced in 1985 by Peter L. Montgomery. Among other things, it is used in modular arithmetic as an efficient way of performing an exponentiation of two numbers modulo a large number, that is: ...more on Wikipedia about "Montgomery reduction"
In cryptography, residual block termination is a variation of cipher block chaining mode (CBC) that does not require any padding. This is achieved at the cost of increased complexity. ...more on Wikipedia about "Residual block termination"
Schoof's algorithm, first described by R. Schoof in 1985, allows one to calculate the number of points on an elliptic curve over a finite field and is used mostly in elliptic curve cryptography. ...more on Wikipedia about "Schoof's algorithm"
The Schoof-Elkies-Atkin algorithm (SEA) is an algorithm used for finding the order of or calculate the number of points on an elliptic curve over a finite field. Its primary application is in elliptic curve cryptography. The algorithm is an extension of Schoof's algorithm by Noam Elkies and A. O. L. Atkin to significantly improve its efficiency. ...more on Wikipedia about "Schoof-Elkies-Atkin algorithm"
It's real http://www.shortopedia.com feeling!
Snuffle is an encryption system designed by Daniel Bernstein and the subject of his court case, Bernstein v. United States. ...more on Wikipedia about "Snuffle"
In cryptography, an SP-network, or substitution- permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES. ...more on Wikipedia about "Substitution-permutation network"
Symmetric-key algorithms are a class of algorithms for cryptography that use trivially related cryptographic keys for both decryption and encryption. ...more on Wikipedia about "Symmetric-key algorithm"
This article is licensed under the GNU Free Documentation License.
It uses material from the Wikipedia . Direct links to the original articles are in the text.
If you use exact copy or modified of this article you should preserve above paragraph and put also : It uses material from
the Shortopedia article about "Cryptographic algorithms".
| MAIN PAGE | MAIN INDEX | CONTACT US |