|
NUSH
In cryptography, NUSH is a block cipher invented by Anatoly Lebedev and Alexey Volchkov for the Russian company LAN Crypto. It was submitted to the NESSIE project, but was not selected. NUSH exists in several different variants, using keys of 128, 192, or 256 bits, and a block size of 64, 128, or 256 bits. The number of rounds is 9, 17, or 33, depending on the block size. The algorithm uses key whitening, but no S-boxes; the only operations it uses are AND, OR, XOR, modular addition, and bit rotation. It has been shown that linear cryptanalysis can break NUSH with less effort than a brute force attack In cryptography, a brute-force attack consists of an attacker submitting many passwords or passphrases with the hope of eventually guessing correctly. The attacker systematically checks all possible passwords and passphrases until the correct .... References Broken block ciphers {{crypto-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NESSIE
NESSIE (New European Schemes for Signatures, Integrity and Encryption) was a European research project funded from 2000 to 2003 to identify secure cryptographic primitives. The project was comparable to the NIST AES process and the Japanese Government-sponsored CRYPTREC project, but with notable differences from both. In particular, there is both overlap and disagreement between the selections and recommendations from NESSIE and CRYPTREC (as of the August 2003 draft report). The NESSIE participants include some of the foremost active cryptographers in the world, as does the CRYPTREC project. NESSIE was intended to identify and evaluate quality cryptographic designs in several categories, and to that end issued a public call for submissions in March 2000. Forty-two were received, and in February 2003 twelve of the submissions were selected. In addition, five algorithms already publicly known, but not explicitly submitted to the project, were chosen as "selectees". The project has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anatoly Lebedev
Anatoly (russian: Анато́лий, Anatólij , uk, Анато́лій, Anatólij ) is a common Russian and Ukrainian male given name, derived from the Greek name ''Anatolios'', meaning "sunrise." Other common Russian transliterations are Anatoliy and Anatoli. The Ukrainian transliteration is Anatoliy or Anatolii. The French version of the name is Anatole. Other variants are Anatol and more rarely Anatolio. Saint Anatolius of Alexandria was a fifth-century saint who became the first patriarch of Constantinople in 451. Anatoly was one of the five most popular names for baby boys born in St. Petersburg, Russia, in 2004. One in every 35,110 Americans are named Anatoly and the popularity of the name Anatoly is 28.48 people per million. The name of Anatolia – a region located to the east from the Greeks' point of view – shares the same linguistic origin. People * Anatoli Agrofenin (born 1980), Russian footballer * Anatoli Aleksandrovich Grishin (born 1986), Russian footba ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexey Volchkov
Alexey, Alexei, Alexie, Aleksei, or Aleksey (russian: Алексе́й ; bg, Алексей ) is a Russian and Bulgarian male first name deriving from the Greek ''Aléxios'' (), meaning "Defender", and thus of the same origin as the Latin Alexius. Alexey may also be romanized as ''Aleksei'', ''Aleksey'', ''Alexej'', ''Aleksej'', etc. It has been commonly westernized as Alexis. Similar Ukrainian and Belarusian names are romanized as Oleksii (Олексій) and Aliaksiej (Аляксей), respectively. The Russian Orthodox Church uses the Old Church Slavonic version, Alexiy (Алексiй, or Алексий in modern spelling), for its Saints and hierarchs (most notably, this is the form used for Patriarchs Alexius I and Alexius II). The common hypocoristic is Alyosha () or simply Lyosha (). These may be further transformed into Alyoshka, Alyoshenka, Lyoshka, Lyoha, Lyoshenka (, respectively), sometimes rendered as Alesha/Aleshenka in English. The form Alyosha ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Cryptanalysis
In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers; the other being differential cryptanalysis. The discovery is attributed to Mitsuru Matsui, who first applied the technique to the FEAL cipher (Matsui and Yamagishi, 1992). Subsequently, Matsui published an attack on the Data Encryption Standard (DES), eventually leading to the first experimental cryptanalysis of the cipher reported in the open community (Matsui, 1993; 1994). The attack on DES is not generally practical, requiring 247 known plaintexts. A variety of refinements to the attack have been suggested, including using multiple linear approximations or incorporating non-linear expressions, leading to a generalized partitioning cryptanalysis. Evidence of security against linear cryptanalysis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lars Knudsen
Lars Ramkilde Knudsen (born 21 February 1962) is a Danish researcher in cryptography, particularly interested in the design and analysis of block ciphers, hash functions and message authentication codes (MACs). Academic After some early work in banking, Knudsen enrolled at Aarhus University in 1984 studying mathematics and computer science, gaining an MSc in 1992 and a PhD in 1994. From 1997-2001, he worked at the University of Bergen, Norway. Currently, Knudsen is a professor in the Department of Mathematics at the Technical University of Denmark. Ivan Damgård was Lars' mentor during his studies at Aarhus University. His Ph.D. was refereed by Bart Preneel. Publications Knudsen has published a couple of papers on cryptanalysis of cryptographic primitives, including the R-MAC scheme, the SHA-1 and MD2 hash functions, and a couple of block ciphers: DES, DFC, IDEA, ICE, LOKI, MISTY, RC2, RC5, RC6, SC2000, Skipjack, Square and SAFER. Knudsen was involved in designing some ciph ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptography
Cryptography, or cryptology (from grc, , translit=kryptós "hidden, secret"; and ''graphein'', "to write", or ''-logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others. Core concepts related to information security ( data confidentiality, data integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based payment cards, digital currencies, computer passwords, and military communications. Cryptography prior to the modern age was effectively synonymo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Block Cipher
In cryptography, a block cipher is a deterministic algorithm operating on fixed-length groups of bits, called ''blocks''. Block ciphers are specified cryptographic primitive, elementary components in the design of many cryptographic protocols and are widely used to encryption, encrypt large amounts of data, including in data exchange protocols. A block cipher uses blocks as an unvarying transformation. Even a secure block cipher is suitable for the encryption of only a single block of data at a time, using a fixed key. A multitude of block cipher modes of operation, modes of operation have been designed to allow their repeated use in a secure way to achieve the security goals of confidentiality and authentication, authenticity. However, block ciphers may also feature as building blocks in other cryptographic protocols, such as universal hash functions and pseudorandom number generators. Definition A block cipher consists of two paired algorithms, one for encryption, , and the othe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
LAN Crypto
Lan or LAN may also refer to: Science and technology * Local asymptotic normality, a fundamental property of regular models in statistics * Longitude of the ascending node, one of the orbital elements used to specify the orbit of an object in space * Łan, unit of measurement in Poland * Local area network, a computer network that interconnects within a limited area such as one or more buildings * Lan blood group system, a human blood group Places * Lancashire (Chapman code), England * Lancaster railway station (National Rail station code), England * Capital Region International Airport (IATA airport code), Lansing, Michigan, US * Lan County, Shanxi, China * Łan, Lublin Voivodeship, Poland * Lan (river), Belarus * Llan (placename), a placename element known in Breton as ''lan'' Airlines * LAN Airlines, former name of LATAM Chile, an airline in Chile, with a stake in other airlines: ** LAN Peru, an airline based in Peru ** LAN Ecuador, an airline based in Quito, Ecuador ** L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Key Whitening
In cryptography, key whitening is a technique intended to increase the security of an iterated block cipher. It consists of steps that combine the data with portions of the key. Details The most common form of key whitening is xor-encrypt-xor -- using a simple XOR before the first round and after the last round of encryption. The first block cipher to use a form of key whitening is DES-X, which simply uses two extra 64-bit keys for whitening, beyond the normal 56-bit key of DES. This is intended to increase the complexity of a brute force attack, increasing the effective size of the key without major changes in the algorithm. DES-X's inventor, Ron Rivest, named the technique ''whitening''. The cipher FEAL (followed by Khufu and Khafre) introduced the practice of key whitening using portions of the same key used in the rest of the cipher. This offers no additional protection from brute force attacks, but it can make other attacks more difficult. In a Feistel cipher or similar al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Substitution Box
In cryptography, an S-box (substitution-box) is a basic component of symmetric key algorithms which performs substitution. In block ciphers, they are typically used to obscure the relationship between the key and the ciphertext, thus ensuring Shannon's property of confusion. Mathematically, an S-box is a vectorial Boolean function. In general, an S-box takes some number of input bits, ''m'', and transforms them into some number of output bits, ''n'', where ''n'' is not necessarily equal to ''m''. An ''m''×''n'' S-box can be implemented as a lookup table with 2''m'' words of ''n'' bits each. Fixed tables are normally used, as in the Data Encryption Standard (DES), but in some ciphers the tables are generated dynamically from the key (e.g. the Blowfish and the Twofish encryption algorithms). Example One good example of a fixed table is the S-box from DES (S5), mapping 6-bit input into a 4-bit output: Given a 6-bit input, the 4-bit output is found by selecting the row using th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary And
In computer programming, a bitwise operation operates on a bit string, a bit array or a binary numeral (considered as a bit string) at the level of its individual bits. It is a fast and simple action, basic to the higher-level arithmetic operations and directly supported by the processor. Most bitwise operations are presented as two-operand instructions where the result replaces one of the input operands. On simple low-cost processors, typically, bitwise operations are substantially faster than division, several times faster than multiplication, and sometimes significantly faster than addition. While modern processors usually perform addition and multiplication just as fast as bitwise operations due to their longer instruction pipelines and other architectural design choices, bitwise operations do commonly use less power because of the reduced use of resources. Bitwise operators In the explanations below, any indication of a bit's position is counted from the right (least signif ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Logical Disjunction
In logic, disjunction is a logical connective typically notated as \lor and read aloud as "or". For instance, the English language sentence "it is raining or it is snowing" can be represented in logic using the disjunctive formula R \lor S , assuming that R abbreviates "it is raining" and S abbreviates "it is snowing". In classical logic, disjunction is given a truth functional semantics according to which a formula \phi \lor \psi is true unless both \phi and \psi are false. Because this semantics allows a disjunctive formula to be true when both of its disjuncts are true, it is an ''inclusive'' interpretation of disjunction, in contrast with exclusive disjunction. Classical proof theoretical treatments are often given in terms of rules such as disjunction introduction and disjunction elimination. Disjunction has also been given numerous non-classical treatments, motivated by problems including Aristotle's sea battle argument, Heisenberg's uncertainty principle, as well ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
