Sciweavers

329 search results - page 8 / 66
» SLX: the X is for extensibility
Sort
View
ICFP
2003
ACM
16 years 6 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
16 years 10 days ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
IPPS
2006
IEEE
16 years 2 days ago
An automated development framework for a RISC processor with reconfigurable instruction set extensions
By coupling a reconfigurable hardware to a standard processor, high levels of flexibility and adaptability are achieved. However, this approach requires modifications to the compi...
Nikolaos Vassiliadis, George Theodoridis, Spiridon...
ASIACRYPT
2007
Springer
16 years 7 days ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
IPPS
2007
IEEE
16 years 11 days ago
Model-Guided Empirical Optimization for Multimedia Extension Architectures: A Case Study
Compiler technology for multimedia extensions must effectively utilize not only the SIMD compute engines but also the various levels of the memory hierarchy: superword registers,...
Chun Chen, Jaewook Shin, Shiva Kintali, Jacqueline...