|
Akelarre (cipher)
Akelarre is a block cipher proposed in 1996, combining the basic design of IDEA (cipher), IDEA with ideas from RC5. It was shown to be susceptible to a ciphertext-only attack in 1997. Akelarre is a 128-bit block cipher with a variable key-length which must be some multiple of 64 bits. The number of rounds is variable, but four are suggested. The round function of Akelarre is similar to IDEA in structure. After the successful cryptanalysis of Akelarre, its designers responded with an updated variant called Ake98. This cipher differs from the original Akelarre in the new ''AR-box'' (addition–rotation box), the swapping of words at the end of a round, and the addition of subkeys at the beginning of each round. In 2004, Jorge Nakahara, Jr. and Daniel Santana de Freitas found large classes of weak keys for Ake98. These weak keys allow a cryptanalysis faster than exhaustive search using only 71 known plaintexts, for up to 11.5 rounds of Ake98. References * * * * * {{Cry ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Data Encryption Algorithm
In cryptography, the International Data Encryption Algorithm (IDEA), originally called Improved Proposed Encryption Standard (IPES), is a Symmetric-key algorithm, symmetric-key block cipher designed by James Massey of ETH Zurich and Xuejia Lai and was first described in 1991. The algorithm was intended as a replacement for the Data Encryption Standard (DES). IDEA is a minor revision of an earlier cipher, the Proposed Encryption Standard (PES). The cipher was designed under a research contract with the Hasler Foundation, which became part of Ascom-Tech AG. The cipher was patented in a number of countries but was freely available for non-commercial use. The name "IDEA" is also a trademark. The last patents expired in 2012, and IDEA is now patent-free and thus completely free for all uses. IDEA was used in Pretty Good Privacy (PGP) v2.0 and was incorporated after the original cipher used in v1.0, BassOmatic, was found to be insecure. IDEA is an optional algorithm in the OpenPGP stan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Niels Ferguson
Niels T. Ferguson (born 10 December 1965, Eindhoven) is a Dutch cryptographer and consultant who currently works for Microsoft. He has worked with others, including Bruce Schneier, designing cryptographic algorithms, testing algorithms and protocols, and writing papers and books. Among the designs Ferguson has contributed to is the AES finalist block cipher algorithm Twofish as well as the stream cipher Helix and the Skein hash function. In 1999, Niels Ferguson, together with Bruce Schneier and John Kelsey, developed the Yarrow algorithm, a Cryptographically-Secure Pseudorandom Number Generator (CSPRNG). Yarrow was later further developed by Niels Ferguson and Bruce Schneier into the Fortuna CSPRNG. In 2001, he claimed to have broken the HDCP system that is incorporated into HD DVD and Blu-ray Discs players, similar to the DVDs Content Scramble System, but has not published his research, citing the Digital Millennium Copyright Act of 1998, which would make such publi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptologia
''Cryptologia'' is a journal in cryptography published six times per year since January 1977. Its remit is all aspects of cryptography, with a special emphasis on historical aspects of the subject. The founding editors were Brian J. Winkel, David Kahn, Louis Kruh, Cipher A. Deavours and Greg Mellen. The current Editor-in-Chief is Craig Bauer. The journal was initially published at the Rose-Hulman Institute of Technology. In July 1995, it moved to the United States Military Academy, and was then published by Taylor & Francis Taylor & Francis Group is an international company originating in the United Kingdom that publishes books and academic journals. Its parts include Taylor & Francis, CRC Press, Routledge, F1000 (publisher), F1000 Research and Dovepress. It i ... since the January 2006 issue (Volume 30, Number 1).Brian J. Winkel, Letter From the Editor, ''Cryptologia'' 29(4), October 2005 See also * Journal of Cryptology * Cryptogram * Cryptology ePrint Archive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vincent Rijmen
Vincent Rijmen (; born 16 October 1970) is a Belgium, Belgian cryptographer and one of the two designers of the Rijndael, the Advanced Encryption Standard. Rijmen is also the co-designer of the WHIRLPOOL cryptographic hash function, and the block ciphers Anubis (cipher), Anubis, KHAZAD, Square (cipher), Square, NOEKEON and SHARK. In 1993, Rijmen obtained a degree in electronics engineering at the Katholieke Universiteit Leuven. Afterwards, he was a PhD student at the ESAT/COSIC lab of the K.U.Leuven. In 1997, Rijmen finished his doctoral dissertation titled ''Cryptanalysis and design of iterated block ciphers''. After his PhD he did postdoctoral work at the COSIC lab, on several occasions collaborating with Joan Daemen. One of their joint projects resulted in the algorithm Rijndael, which in October 2000 was selected by the National Institute for Standards and Technology (NIST) to become the Advanced Encryption Standard (AES). Since 1 August 2001, Rijmen has been working as chie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lars Knudsen
Lars Ramkilde Knudsen (born 21 February 1962) is a Denmark, Danish researcher in cryptography, particularly interested in the design and cryptanalysis, analysis of block ciphers, cryptographic hash function, 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. In 1999 he became a professor at the University of Bergen, Norway and in 2001 he became a professor at the Technical University of Denmark (DTU). Ivan Damgård was Lars' mentor during his studies at Aarhus University. Publications Knudsen has published a couple of papers on cryptanalysis of cryptographic primitives, including the R-MAC scheme, the SHA-1 and MD2 (cryptography), MD2 hash functions, and a couple of block ciphers: Data Encryption Standard, DES, DFC (cipher), DFC, IDEA (cipher), IDEA, ICE (cipher), ICE, LOKI, MISTY, RC2, RC5, RC6, SC200 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Carleton University
Carleton University is an English-language public university, public research university in Ottawa, Ontario, Canada. Founded in 1942 as Carleton College, the institution originally operated as a private, non-denominational evening college to serve returning World War II veterans. Carleton was chartered as a university by the provincial government in 1952 through ''The Carleton University Act,'' which was then amended in 1957, giving the institution its current name. The university is named after the now-dissolved Carleton County, Ontario, Carleton County, which included the city of Ottawa at the time the university was founded. Carleton is organized into five faculties and with more than 65 degree programs. It has several specialized institutions, including the Arthur Kroeger College of Public Affairs, the Norman Paterson School of International Affairs, the Carleton School of Journalism, the School of Public Policy and Administration, and the Sprott School of Business. As of 2 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bruce Schneier
Bruce Schneier (; born January 15, 1963) is an American cryptographer, computer security professional, privacy specialist, and writer. Schneier is an Adjunct Lecturer in Public Policy at the Harvard Kennedy School and a Fellow at the Berkman Klein Center for Internet & Society as of November, 2013. He is a board member of the Electronic Frontier Foundation, Access Now, and The Tor Project; and an advisory board member of Electronic Privacy Information Center and VerifiedVoting.org. He is the author of several books on general security topics, computer security and cryptography and is a squid enthusiast. Early life and education Bruce Schneier is the son of Martin Schneier, a Brooklyn Supreme Court judge. He grew up in the Flatbush neighborhood of Brooklyn, New York, attending P.S. 139 and Hunter College High School. After receiving a physics bachelor's degree from the University of Rochester in 1984, he went to American University in Washington, D.C., and got his ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PostScript
PostScript (PS) is a page description language and dynamically typed, stack-based programming language. It is most commonly used in the electronic publishing and desktop publishing realm, but as a Turing complete programming language, it can be used for many other purposes as well. PostScript was created at Adobe Systems by John Warnock, Charles Geschke, Doug Brotz, Ed Taft and Bill Paxton from 1982 to 1984. The most recent version, PostScript 3, was released in 1997. History The concepts of the PostScript language were seeded in 1976 by John Gaffney at Evans & Sutherland, a computer graphics company. At that time, Gaffney and John Warnock were developing an interpreter for a large three-dimensional graphics database of New York Harbor. Concurrently, researchers at Xerox PARC had developed the first laser printer and had recognized the need for a standard means of defining page images. In 1975–76 Bob Sproull and William Newman developed the Press format, whic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lai–Massey Scheme
The Lai–Massey scheme is a cryptographic structure used in the design of block ciphers, an alternative to the Feistel network for converting a non-invertible keyed round function to an invertible keyed cipher. It is used in IDEA and IDEA NXT. The scheme was originally introduced by Xuejia LaiX. Lai. On the design and security of block ciphers'. ETH Series in Information Processing, vol. 1, Hartung-Gorre, Konstanz, 1992 with the assistance of James L. Massey, hence the scheme's name, ''Lai-Massey''. Design The Lai-Massey Scheme is similar to a Feistel network in design, but in addition to using a using a non-invertible ''round function'' whose input and output is half the data block size, each round uses a full-width invertible ''half-round function''. Either, or preferably both of the functions may take a key input as well. Initially, the inputs are passed through the half-round function. In each round, the difference between the inputs is passed to the round function ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Queen's University, Kingston
Queen's University at Kingston, commonly known as Queen's University or simply Queen's, is a public university, public research university in Kingston, Ontario, Kingston, Ontario, Canada. Queen's holds more than of land throughout Ontario and owns Herstmonceux Castle in East Sussex, England. Queen's is organized into eight faculties and schools. The Church of Scotland established Queen's College in October 1841 via a royal charter from Queen Victoria. The first classes, intended to prepare students for the ministry, were held 7 March 1842, with 15 students and two professors. In 1869, Queen's was the first Canadian university west of the The Maritimes, Maritime provinces to admit women. In 1883, a women's college for medical education affiliated with Queen's University was established after male staff and students reacted with hostility to the admission of women to the university's medical classes. In 1912, Queen's ended its affiliation with the Presbyterian Church, and adopted ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weak Key
In cryptography, a weak key is a key, which, used with a specific cipher, makes the cipher behave in some undesirable way. Weak keys usually represent a very small fraction of the overall keyspace, which usually means that, a cipher key made by random number generation is very unlikely to give rise to a security problem. Nevertheless, it is considered desirable for a cipher to have no weak keys. A cipher with no weak keys is said to have a ''flat'', or ''linear'', key space. Historical origins Virtually all rotor-based cipher machines (from 1925 onwards) have implementation flaws that lead to a substantial number of weak keys being created. Some rotor machines have more problems with weak keys than others, as modern block and stream ciphers do. The first stream cipher machines were also rotor machines and had some of the same problems of weak keys as the more traditional rotor machines. The T52 was one such stream cipher machine that had weak key problems. The British first ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
