|
Rivest
Ronald Linn Rivest (; born May 6, 1947) is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). His work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman). He is the inventor of the symmetric key encryption algorithms RC2, RC4, RC5, and co-inventor of RC6. The "RC" stands for "Rivest Cipher", or alternatively, "Ron's Code". (RC3 was broken at RSA Security during development; similarly, RC1 was never published.) He also authored 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 resea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
RSA (algorithm)
RSA (Rivest–Shamir–Adleman) is a public-key cryptosystem that is widely used for secure data transmission. It is also one of the oldest. The acronym "RSA" comes from the surnames of Ron Rivest, Adi Shamir and Leonard Adleman, who publicly described the algorithm in 1977. An equivalent system was developed secretly in 1973 at Government Communications Headquarters (GCHQ) (the British signals intelligence agency) by the English mathematician Clifford Cocks. That system was declassified in 1997. In a public-key cryptosystem, the encryption key is public and distinct from the decryption key, which is kept secret (private). An RSA user creates and publishes a public key based on two large prime numbers, along with an auxiliary value. The prime numbers are kept secret. Messages can be encrypted by anyone, via the public key, but can only be decoded by someone who knows the prime numbers. The security of RSA relies on the practical difficulty of factoring the product of two ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
RC4 (cipher)
In cryptography, RC4 (Rivest Cipher 4, also known as ARC4 or ARCFOUR, meaning Alleged RC4, see below) is a stream cipher. While it is remarkable for its simplicity and speed in software, multiple vulnerabilities have been discovered in RC4, rendering it insecure. It is especially vulnerable when the beginning of the output keystream is not discarded, or when nonrandom or related keys are used. Particularly problematic uses of RC4 have led to very insecure protocols such as WEP. , there is speculation that some state cryptologic agencies may possess the capability to break RC4 when used in the TLS protocol. IETF has published RFC 7465 to prohibit the use of RC4 in TLS; Mozilla and Microsoft have issued similar recommendations. A number of attempts have been made to strengthen RC4, notably Spritz, RC4A, VMPC, and RC4+. History RC4 was designed by Ron Rivest of RSA Security in 1987. While it is officially termed "Rivest Cipher 4", the RC acronym is alternatively understood to ... [...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] |
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] |
Ring Signature
In cryptography, a ring signature is a type of digital signature that can be performed by any member of a set of users that each have keys. Therefore, a message signed with a ring signature is endorsed by someone in a particular set of people. One of the security properties of a ring signature is that it should be computationally infeasible to determine ''which'' of the set's members' keys was used to produce the signature. Ring signatures are similar to group signatures but differ in two key ways: first, there is no way to revoke the anonymity of an individual signature; and second, any set of users can be used as a signing set without additional setup. Ring signatures were invented by Ron Rivest, Adi Shamir, and Yael Tauman Kalai, and introduced at ASIACRYPT in 2001. The name, ''ring signature'', comes from the ring-like structure of the signature algorithm. Definition Suppose that a set of entities each have public/private key pairs, (''P''1, ''S''1), (''P''2, ''S''2), ... ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alan Sherman
Alan Theodore Sherman (born February 26, 1957) is a full professor of computer science at UMBC, director of the UMBC Center for Information Security and Assurance (CISA), and director of the UMBC Chess Program. Sherman is an editor for Cryptologia, and is a member of Phi Beta Kappa and Sigma Xi. Biography Education Sherman earned a Bachelor's degree in Mathematics from Brown University in 1978, a Master's Degree in Electrical Engineering and Computer Science from MIT in 1981, and a Ph.D. degree in Computer Science from MIT in 1987. Professor Sherman's research interests include security of voting systems, cryptology, information assurance, and discrete algorithms. Chess Sherman has been the faculty advisor of the UMBC Chess Club since 1991, after playing in a student vs. faculty matc He recruits chess players worldwide with academic scholarship UMBC has been ranked among the best college teams, winning the Pan American Intercollegiate Team Chess Championship in 1996, 1998, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrea LaPaugh
Andrea Suzanne LaPaugh is an American computer scientist and professor emerita of computer science at Princeton University. Her research has concerned the design and analysis of algorithms, particularly for graph algorithms, problems involving the computer-aided design of VLSI circuits, and document retrieval. Early life and education LaPaugh is originally from Middletown, Connecticut, where her father worked in an office and her mother was a librarian; she majored in physics at Cornell University. This was at a time when Cornell had no undergraduate computer science program, but she became interested in computer science through courses on mathematical logic and formal languages, with instructors including Anil Nerode, Juris Hartmanis, and John Hopcroft. She began her doctoral studies at the Massachusetts Institute of Technology in 1974, working with Ron Rivest on graph algorithms, and finished her Ph.D. there in 1980 with the dissertation ''Algorithms for Integrated Circuit Layou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MD2 (cryptography)
The MD2 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers. MD2 is specified in IETF RFC 1319. The "MD" in MD2 stands for "Message Digest". Even though MD2 is not yet fully compromised, the IETF retired MD2 to "historic" status in 2011, citing "signs of weakness". It is deprecated in favor of SHA-256 and other strong hashing algorithms. Nevertheless, , it remained in use in public key infrastructures as part of certificates generated with MD2 and RSA. Description The 128-bit hash value of any message is formed by padding it to a multiple of the block length (128 bits or 16 bytes) and adding a 16-byte checksum to it. For the actual calculation, a 48-byte auxiliary block and a 256-byte S-table. The constants were generated by shuffling the integers 0 through 255 using a variant of Durstenfeld's algorithm with a pseudorandom number generator based on decimal digits of (pi) (see nothin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mona Singh (scientist)
Mona Singh is a Professor of Computer Science in the Lewis-Sigler Institute for Integrative Genomics at Princeton University. Education Singh was educated at Indian Springs School, Harvard University and Massachusetts Institute of Technology where she was awarded a PhD in 1996 for research supervised by Ron Rivest and Bonnie Berger. Career and research Singh's research interests are in computational biology, genomics, bioinformatics and their interfaces with machine learning and algorithms. Awards and honors Singh was awarded a Presidential Early Career Award for Scientists and Engineers (PECASE) from the National Science Foundation (NSF) in 2001. She was elected a Fellow of the International Society for Computational Biology (ISCB) in 2018 for “outstanding contributions to the fields of computational biology and bioinformatics”. She was elected an ACM Fellow ACM or A.C.M. may refer to: Aviation * AGM-129 ACM, 1990–2012 USAF cruise missile * Air chief marshal * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andrew Sutherland (mathematician)
Andrew Victor Sutherland is an American mathematician and Principal Research Scientist at the Massachusetts Institute of Technology. His research focuses on computational aspects of number theory and arithmetic geometry. He is known for his contributions to several projects involving large scale computations, including the Polymath project on bounded gaps between primes, the L-functions and Modular Forms Database, the sums of three cubes project, and the computation and classification of Sato-Tate conjecture, Sato-Tate distributions. Education and career Sutherland earned a bachelor's degree in mathematics from MIT in 1990. Following an entrepreneurial career in the software industry he returned to MIT and completed his doctoral degree in mathematics in 2007 under the supervision of Michael Sipser and Ronald Rivest, winning the George M. Sprowls prize for this thesis. He joined the MIT mathematics department as a Research Scientist in 2009, and was promoted to Principal Research ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paris Kanellakis Award
The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing". It was instituted in 1996, in memory of Paris C. Kanellakis, a computer scientist who died with his immediate family in an airplane crash in South America in 1995 (American Airlines Flight 965). The award is accompanied by a prize of $10,000 and is endowed by contributions from Kanellakis's parents, with additional financial support provided by four ACM Special Interest Groups (SIGACT, SIGDA, SIGMOD, and SIGPLAN), the ACM SIG Projects Fund, and individual contributions. Winners See also * List of computer science awards This list of computer science awards is an index to articles on notable awards related to computer science. It includes lists of awards by the Association for Computing Machinery, the Institute of Electrical and Electronic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Avrim Blum
Avrim Blum (born 27 May 1966) is a computer scientist. In 2007, he was made a List of Fellows of the Association for Computing Machinery, Fellow of the Association for Computing Machinery "for contributions to learning theory and algorithms." Blum attended MIT, where he received his Doctor of Philosophy, Ph.D. in 1991 under professor Ron Rivest. He was a professor of computer science at Carnegie Mellon University from 1991 to 2017. In 2017, he joined Toyota Technological Institute at Chicago as professor and chief academic officer. His main work has been in the area of theoretical computer science, with particular activity in the fields of machine learning, computational learning theory, algorithmic game theory, database privacy, and algorithms. Avrim is the son of two other well-known computer scientists, Manuel Blum, 1995 Turing Award winner, and Lenore Blum. See also * Co-training References External links Videos of Avrim lecturing {{DEFAULTSORT:Blum, Avrim 1966 bi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
