Showing papers by "Juris Hartmanis published in 2001"
Book•
01 Jan 2001
TL;DR: Simplified variants that omit a quadratic function and a fixed rotation in RC6 are examined to clarify their essential contribution to the overall security of RC6.
Abstract: RC6 has been submitted as a candidate for the Advanced Encryption Standard (AES). Two important features of RC6 that were absent from its predecessor RC5 are a quadratic function and a fixed rotation. By examining simplified variants that omit these features we clarify their essential contribution to the overall security of RC6.
1,487 citations
01 Jan 2001
TL;DR: The name Quilt suggests both the way in which features from several languages were assembled to make a new query language, and theway in which Quilt queries can combine information from diverse data sources into a query result with a new structure of its own.
Abstract: The World Wide Web promises to transform human society by making virtually all types of information instantly available everywhere. Two prerequisites for this promise to be realized are a universal markup language and a universal query language. The power and flexibility of XML make it the leading candidate for a universal markup language. XML provides a way to label information from diverse data sources including structured and semi-structured documents, relational databases, and object repositories. Several XML-based query languages have been proposed, each oriented toward a specific category of information. Quilt is a new proposal that attempts to unify concepts from several of these query languages, resulting in a new language that exploits the full versatility of XML. The name Quilt suggests both the way in which features from several languages were assembled to make a new query language, and the way in which Quilt queries can combine information from diverse data sources into a query result with a new structure of its own.
120 citations
TL;DR: How the major computational complexity classes, P, NP and PSPACE, capture different computational properties of mathematical proofs and reveal new quantitative aspects of mathematics are discussed.
Abstract: This paper discusses howthe major computational complexity classes, P, NP and PSPACE, capture different computational properties of mathematical proofs and reveal newq uantitative aspects of mathematics.