|
Ronald L. 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, Rivest is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Schenectady, New York
Schenectady ( ) is a City (New York), city in Schenectady County, New York, United States, of which it is the county seat. As of the United States Census 2020, 2020 census, the city's population of 67,047 made it the state's ninth-most populous city and the twenty-fifth most-populous municipality. The city is in eastern New York, near the confluence of the Mohawk River, Mohawk and Hudson River, Hudson rivers. It is in the same Capital District (New York), metropolitan area as the state capital, Albany, New York, Albany, which is about southeast. Schenectady was founded on the south side of the Mohawk River by Dutch colonists in the 17th century, many of whom came from the Albany area. The name "Schenectady" is derived from the Mohawk language, Mohawk word ''skahnéhtati'', meaning "beyond the pines" and used for the area around Albany, New York. Residents of the new village developed farms on strip plots along the river. Union College, the first non-denominational institut ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anna Lysyanskaya
Anna A. Lysyanskaya is a cryptographer known for her research on digital signatures and anonymous digital credentials. She is the James A. and Julie N. Brown Professor of Computer Science at Brown University. Early life and education Lysyanskaya grew up in Kiev, Ukrainian SSR, Soviet Union (now Kyiv, Ukraine), and came to the US in 1993 to attend Smith College, where she graduated in 1997. She went to the Massachusetts Institute of Technology for graduate study, earning a master's degree in 1999 and completing her Ph.D. in 2002. Her dissertation, ''Signature Schemes and Applications to Cryptographic Protocol Design'', was supervised by Ron Rivest. Career After completing her doctorate, Lysyanskaya joined the Brown University faculty in 2002. She was given the James A. and Julie N. Brown Professorship in 2023. She is a member of the board of directors of the International Association for Cryptologic Research, first elected in 2012, and re-elected for three additional three-year ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
BBVA Foundation Frontiers Of Knowledge Awards
The BBVA Foundation Frontiers of Knowledge Awards () are an international award programme recognizing significant contributions in the areas of scientific research and cultural creation. The categories that make up the Frontiers of Knowledge Awards respond to the knowledge map of the present age. As well as the fundamental knowledge that is at their core, they address developments in information and communication technologies, and interactions between biology and medicine, ecology and conservation biology, climate change, economics, humanities and social sciences, and, finally, contemporary musical creation and performance. Specific categories are reserved for developing knowledge fields of critical relevance to confront central challenges of the 21st century, as in the case of the two environmental awards. The awards were established in 2008, with the first set of winners receiving their prizes in 2009. The BBVA Foundation – belonging to financial group BBVA – is partnered in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Marconi Prize
The Marconi Prize is an annual award recognizing achievements and advancements made in field of communications (radio, mobile, wireless, telecommunications, data communications, networks, and Internet). The prize is awarded by the Marconi Society and it includes a work of sculpture. Recipients of the prize are awarded at the Marconi Society's annual symposium and gala. Criteria The Marconi Prize is awarded based on the candidate’s contributions in the following areas: * The significance of the impact of the nominee’s work on widely-used technology. * The scientific importance of the nominee’s work in setting the stage for, influencing, and advancing the field beyond the nominee’s own achievements. * The nominee’s contributions to innovation and entrepreneurship by introducing completely new ideas, methods, or technologies. These may include forming, leading, or advising organizations, mentoring students on moving ideas from research to implementation, or fostering new ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing Award
The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science. It is generally recognized as the highest distinction in the field of computer science and is often referred to as the "List of prizes known as the Nobel of a field or the highest honors of a field, Nobel Prize of Computing". , 79 people have been awarded the prize, with the most recent recipients being Andrew Barto and Richard S. Sutton, who won in 2024. The award is named after Alan Turing, also referred as "Father of Computer Science", who was a British mathematician and Reader (academic rank), reader in mathematics at the University of Manchester. Turing is often credited as being the founder of theoretical computer science and artificial intelligence, and a key contributor to the Allied cryptanalysis of the Enigma cipher during World War II. From 2007 to 2013, the award was accompanied by a prize ... [...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 Electroni ... [...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] |
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 are used. 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) (s ... [...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] |
RSA (algorithm)
The RSA (Rivest–Shamir–Adleman) cryptosystem is a public-key cryptosystem, one of the oldest widely used for secure data transmission. The initialism "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 decrypted by someone who knows the private key. The security of RSA relies on the practical difficulty of factoring the product of two ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Public-key
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security. There are many kinds of public-key cryptosystems, with different security goals, including digital signature, Diffie–Hellman key exchange, public-key key encapsulation, and public-key encryption. Public key algorithms are fundamental security primitives in modern cryptosystems, including applications and protocols that offer assurance of the confidentiality and authenticity of electronic communications and data storage. They underpin numerous Internet standards, such as Transport Layer Security (TLS), SSH, S/MIME, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mona Singh (scientist)
Mona Singh is an American computer scientist and researcher in the field of computational molecular biology and bioinformatics. She is the Wang Family Professor in Computer Science in the Lewis-Sigler Institute for Integrative Genomics and the Department of Computer Science at Princeton University. Since 2021, she has been the Editor-in-Chief of the Journal of Computational Biology. Education Singh was educated at Indian Springs School, Harvard University, and the Massachusetts Institute of Technology (MIT), 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 Comput ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
