|
Md500n
The MD5 message-digest algorithm is a widely used hash function producing a 128-bit hash value. MD5 was designed by Ronald Rivest in 1991 to replace an earlier hash function MD4, and was specified in 1992 as RFC 1321. MD5 can be used as a checksum to verify data integrity against unintentional corruption. Historically it was widely used as a cryptographic hash function; however it has been found to suffer from extensive vulnerabilities. It remains suitable for other non-cryptographic purposes, for example for determining the partition for a particular key in a partitioned database, and may be preferred due to lower computational requirements than more recent Secure Hash Algorithms. History and cryptanalysis MD5 is one in a series of message digest algorithms designed by Professor Ronald Rivest of MIT (Rivest, 1992). When analytic work indicated that MD5's predecessor MD4 was likely to be insecure, Rivest designed MD5 in 1991 as a secure replacement. ( Hans Dobbertin did indee ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ronald Rivest
Ronald Linn Rivest (; born May 6, 1947) is an American cryptographer and computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. He is an Institute Professor at the Massachusetts Institute of Technology (MIT), and a member of MIT's Department of Electrical Engineering and Computer Science and its Computer Science and Artificial Intelligence Laboratory. Along with Adi Shamir and Len Adleman, Rivest is one of the inventors of the RSA algorithm. He is also the inventor of the symmetric key encryption algorithms RC2, RC4, and RC5, and co-inventor of RC6. (''RC'' stands for "Rivest Cipher".) He also devised the MD2, MD4, MD5 and MD6 cryptographic hash functions. Education Rivest earned a bachelor's degree in mathematics from Yale University in 1969, and a Ph.D. degree in computer science from Stanford University in 1974 for research supervised by Robert W. Floyd. Career At MIT, Riv ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
One-way Compression Function
In cryptography, a one-way compression function is a function that transforms two fixed-length inputs into a fixed-length output.Handbook of Applied Cryptography by Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone. Fifth Printing (August 2001) page 328. The transformation is one-way function, "one-way", meaning that it is difficult given a particular output to compute inputs which compress to that output. One-way compression functions are not related to conventional data compression algorithms, which instead can be inverted exactly (lossless compression) or approximately (lossy compression) to the original data. One-way compression functions are for instance used in the Merkle–Damgård construction inside cryptographic hash functions. One-way compression functions are often built from block ciphers. Some methods to turn any normal block cipher into a one-way compression function are Davies–Meyer, Matyas–Meyer–Oseas, Miyaguchi–Preneel (single-block-length compr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vlastimil Klima
Vlastimil is a common Slavic origin given name originating from the roots: ''vlast'' (homeland) and ''mil'' (favour). A variant of the name is Vlastislav. The Czech name days are 17 March (Vlastimil) and 28 April (Vlastislav). The Slovak name day is 13 March (Vlastimil). The feminine form is Vlastimila. Short forms Vlasta, Vlastík, Vlastek, Mila Notable bearers * Vlastislav - prince of Lucko (''luts-kaw'') * Vlastimil Brodský - Czech actor * Vlasta Burian - Czechoslovak actor * Vlastislav Hofman - Czech architect, painter and graphic * Vlastimil Hort, Czechoslovakian/German chess player * Vlastimil Horváth - Czech rock singer * Vlastimil Kopecký - Czech footballer * Vlastimil Lejsek - Czech pianist and composer * Vlastimil Třešňák - Czech folk singer * Vlastimil Tusar - Czech journalist and politician * Vlasta Vrána - Czech-Canadian actor See also * Slavic names Given names originating from the Slavic languages are most common in Slavic peoples, Slavic coun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wang Xiaoyun
Wang Xiaoyun (; born 1966) is a Chinese cryptographer, mathematician, and computer scientist. She is a professor in the Department of Mathematics and System Science of Shandong University and an academician of the Chinese Academy of Sciences. Early life and education Wang was born in Zhucheng, Shandong Province. She gained bachelor's (1987), master's (1990) and doctorate (1993) degrees at Shandong University, and subsequently lectured in the mathematics department from 1993. Her doctoral advisor was Pan Chengdong. Wang was appointed assistant professor in 1995, and full professor in 2001. She became the Chen Ning Yang Professor of the Center for Advanced Study, Tsinghua University in 2005. Career and research At the rump session of CRYPTO 2004, she and co-authors demonstrated collision attacks against MD5, SHA-0 and other related hash functions (a collision occurs when two distinct messages result in the same hash function output). They received a standing ovation for their ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arjen Lenstra
Arjen Klaas Lenstra (born 2 March 1956, in Groningen) is a Dutch mathematician, cryptographer and computational number theorist. He is a professor emeritus from the École Polytechnique Fédérale de Lausanne (EPFL) where he headed of the Laboratory for Cryptologic Algorithms. Career He studied mathematics at the University of Amsterdam. He is a former professor at the EPFL (Lausanne), in the Laboratory for Cryptologic Algorithms, and previously worked for Citibank and Bell Labs. Research Lenstra is active in cryptography and computational number theory, especially in areas such as integer factorization. With Mark Manasse, he was the first to seek volunteers over the internet for a large scale volunteer computing project. Such projects became more common after the Factorization of RSA-129 which was a high publicity distributed factoring success led by Lenstra along with Derek Atkins, Michael Graff and Paul Leyland. He was also a leader in the successful factorizations ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
IBM P690
The IBM System p is a high-end line of RISC (Power)/UNIX-based servers. It was the successor of the RS/6000 line, and predecessor of the IBM Power Systems server series. History The previous RS/6000 line was originally a line of workstations and servers. The first System p server line was named the ''e''Server pSeries in 2000 as part of the e-Server branding initiative. In 2004, with the advent of the POWER5 processor, the server family was rebranded the ''e''Server p5. In 2005, following IBM's move to streamline its server and storage brands worldwide, and incorporating the "System" brand with the Systems Agenda, the family was again renamed to System p5. The System p5 now encompassed the IBM OpenPower product line. In 2007, after the introduction of the POWER6 processor models, the last rename under the System p brand dropped the p (numbered) designation. In April 2008, IBM announced a rebranding of the System p and its unification with the mid-range System i platform. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptology EPrint Archive
The Cryptology ePrint Archive is an electronic archive (eprint) of new results in the field of cryptography, maintained by the International Association for Cryptologic Research. It contains articles covering many of the most recent advances in cryptography, that did not necessarily undergo any refereeing process. See also * arXiv arXiv (pronounced as "archive"—the X represents the Chi (letter), Greek letter chi ⟨χ⟩) is an open-access repository of electronic preprints and postprints (known as e-prints) approved for posting after moderation, but not Scholarly pee ... * Electronic Colloquium on Computational Complexity External links * References Cryptography journals Publications with year of establishment missing Eprint archives Open-access archives {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Xuejia Lai
Xuejia Lai () is a cryptographer, currently a professor at Shanghai Jiao Tong University. His notable work includes the design of the block cipher IDEA based on the Lai-Massey scheme, the theory of Markov ciphers, and the cryptanalysis of a number of cryptographic hash functions. His book ''On the Design and Security of Block Ciphers'' () is frequently cited in cryptography papers. Lai received a B.Sc. in electrical engineering in 1982 and an M.Sc. in mathematics in 1984 at Xidian University (then known as ''Northwest Institute of Telecommunication Engineering''). About 1982 he met James Massey, who was visiting the university to give lectures in cryptography. Lai served as interpreter for these lectures. He later became one of Massey's doctoral students at ETH Zurich ETH Zurich (; ) is a public university in Zurich, Switzerland. Founded in 1854 with the stated mission to educate engineers and scientists, the university focuses primarily on science, technology, enginee ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Xiaoyun Wang
Wang Xiaoyun (; born 1966) is a Chinese cryptographer, mathematician, and computer scientist. She is a professor in the Department of Mathematics and System Science of Shandong University and an academician of the Chinese Academy of Sciences. Early life and education Wang was born in Zhucheng, Shandong Province. She gained bachelor's (1987), master's (1990) and doctorate (1993) degrees at Shandong University, and subsequently lectured in the mathematics department from 1993. Her doctoral advisor was Pan Chengdong. Wang was appointed assistant professor in 1995, and full professor in 2001. She became the Chen Ning Yang Professor of the Center for Advanced Study, Tsinghua University in 2005. Career and research At the rump session of CRYPTO 2004, she and co-authors demonstrated collision attacks against MD5, SHA-0 and other related hash functions (a collision occurs when two distinct messages result in the same hash function output). They received a standing ovation for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distributed Computing
Distributed computing is a field of computer science that studies distributed systems, defined as computer systems whose inter-communicating components are located on different networked computers. The components of a distributed system communicate and coordinate their actions by passing messages to one another in order to achieve a common goal. Three significant challenges of distributed systems are: maintaining concurrency of components, overcoming the lack of a global clock, and managing the independent failure of components. When a component of one system fails, the entire system does not fail. Examples of distributed systems vary from SOA-based systems to microservices to massively multiplayer online games to peer-to-peer applications. Distributed systems cost significantly more than monolithic architectures, primarily due to increased needs for additional hardware, servers, gateways, firewalls, new subnets, proxies, and so on. Also, distributed systems are prone to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MD5CRK
In cryptography, MD5CRK was a volunteer computing effort (similar to distributed.net) launched by Jean-Luc Cooke and his company, CertainKey Cryptosystems, to demonstrate that the MD5 message digest algorithm is insecure by finding a collision two messages that produce the same MD5 hash. The project went live on March 1, 2004. The project ended on August 24, 2004, after researchers independently demonstrated a technique for generating collisions in MD5 using analytical methods by Xiaoyun Wang, Feng, Xuejia Lai, and Yu. CertainKey awarded a 10,000 Canadian Dollar prize to Wang, Feng, Lai and Yu for their discovery. A technique called Floyd's cycle-finding algorithm was used to try to find a collision for MD5. The algorithm can be described by analogy with a random walk. Using the principle that any function with a finite number of possible outputs placed in a feedback loop will cycle, one can use a relatively small amount of memory to store outputs with particular structures and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Birthday Attack
A birthday attack is a bruteforce collision attack that exploits the mathematics behind the birthday problem in probability theory. This attack can be used to abuse communication between two or more parties. The attack depends on the higher likelihood of collisions found between random attack attempts and a fixed degree of permutations ( pigeonholes). Let H be the number of possible values of a hash function, with H=2^l. With a birthday attack, it is possible to find a collision of a hash function with 50% chance in \sqrt = 2^, where l is the bit length of the hash output, and with 2^ being the classical preimage resistance security with the same probability. There is a general (though disputed) result that quantum computers can perform birthday attacks, thus breaking collision resistance, in \sqrt = 2^. Although there are some digital signature vulnerabilities associated with the birthday attack, it cannot be used to break an encryption scheme any faster than a brute-for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
