Lars Knudsen

From Wikipedia, the free encyclopedia

Lars R. Knudsen
Lars R. Knudsen

Lars Ramkilde Knudsen (born February 21, 1962) is a Danish researcher in cryptography, particularly interested in the design and analysis of block ciphers, hash functions and message authentication codes (MACs).

After some early work in banking, Knudsen enrolled at Aarhus University in 1984 studying mathematics and computer science, gaining a 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.

Knudsen has published analyses of a wide variety of cryptographic designs, including the RMAC scheme, the SHA-1 and MD2 hash functions, and at least a dozen block ciphers: DES, DFC, IDEA, ICE, LOKI, MISTY, RC2, RC5, RC6, SC2000, Skipjack, Square and SAFER—it has been hinted that the "SK" in the "SAFER-SK" variant means Stop Knudsen after he had found weaknesses in a previous version. Knudsen has also designed ciphers, including the AES candidates DEAL and Serpent (the latter in conjunction with Ross Anderson and Eli Biham).

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.