Sciweavers

736 search results - page 105 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 8 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
JOC
2006
77views more  JOC 2006»
13 years 8 months ago
An Improved Real-Quadratic-Field-Based Key Exchange Procedure
To date, the only non-group structure that has been suitably employed as the key space for Diffie-Hellman type cryptographic key exchange is the infrastructure of a real quadratic ...
Michael J. Jacobson Jr., Renate Scheidler, Hugh C....
JSC
2006
85views more  JSC 2006»
13 years 8 months ago
Fraction-free row reduction of matrices of Ore polynomials
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
Bernhard Beckermann, Howard Cheng, George Labahn
IJNSEC
2007
82views more  IJNSEC 2007»
13 years 8 months ago
On Software Implementation of Fast DDP-based Ciphers
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
AML
2005
104views more  AML 2005»
13 years 8 months ago
Weak theories of linear algebra
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
Neil Thapen, Michael Soltys