Implementing a 1GHz four-issue out-of-order execution microprocessor in a standard cell ASIC methodology
This paper introduces the microarchitecture and physical implementation of the Godson-2E processor, which is a four-issue superscalar RISC processor that supports the 64-bit MIPS instruction set. The adoption of the aggressive out-of-order execution and ...
An energy-efficient instruction scheduler design with two-level shelving and adaptive banking
Mainstream processors implement the instruction scheduler using a monolithic CAM-based issue queue (IQ), which consumes increasingly high energy as its size scales. In particular, its instruction wakeup logic accounts for a major portion of the consumed ...
A 485ps 64-bit parallel adder in 0.18µm CMOS
This paper presents an optimized 64-bit parallel adder. Sparse-tree architecture enables low carry-merge fanouts and inter-stage wiring complexity. Single-rail and semi-dynamic circuit improves operation speed. Simulation results show that the proposed ...
Unified parallel systolic multiplier over GF(2m)
In general, there are three popular basis representations, standard (canonical, polynomial) basis, normal basis, and dual basis, for representing elements in GF(2m). Various basis representations have their distinct advantages and have their different ...
Bounded model checking of CTL
Bounded Model Checking has been recently introduced as an efficient verification method for reactive systems. This technique reduces model checking of linear temporal logic to propositional satisfiability. In this paper we first present how quantified ...
CSchema: a downgrading policy language for XML access control
The problem of regulating access to XML documents has attracted much attention from both academic and industry communities. In existing approaches, the XML elements specified by access policies are either accessible or inaccessible according to their ...
Two-factor cancelable biometrics authenticator
Biometrics-based authentication system offers advantages of providing high reliability and accuracy. However, the contemporary authentication system is impuissance to compromise. If a biometrics data is compromised, it cannot be replaced and rendered ...
Higher-level hardware synthesis of the KASUMI algorithm
Programmable Logic Devices (PLDs) continue to grow in size and currently contain several millions of gates. At the same time, research effort is going into higher-level hardware synthesis methodologies for reconfigurable computing that can exploit PLD ...
Breaking and repairing trapdoor-free group signature schemes from Asiacrypt'2004
Group signature schemes allow a member of a group to sign messages anonymously on behalf of the group. In case of later dispute, a designated group manager can revoke the anonymity and identify the originator of a signature. In Asiacrypt2004, Nguyen and ...
Relationship between a non-malleable commitment scheme and a modified selective decommitment scheme
The notion of commitment is one of the most important primitives in cryptography. To meet various needs, there have been many kinds of commitment schemes among which non-malleable commitment scheme and selective decommitment scheme are important and in ...
Improved collision attack on hash function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that was presented by Wang et al. in the Conference EUROCRYPT 2005. We found ...
Secure two-party point-circle inclusion problem
Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing ...
Attack on digital multi-signature scheme based on elliptic curve cryptosystem
The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been ...
A new public-key encryption scheme
This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption, the third ...
Efficient ID-based multi-decrypter encryption with short ciphertexts
Multi-decrypter encryption is a typical application in multi-user cryptographic branches. In multi-decrypter encryption, a message is encrypted under multiple decrypters' public keys in the way that only when all the decrypters cooperate, can the ...
Chameleon hashes without key exposure based on factoring
Chameleon hash is the main primitive to construct a chameleon signature scheme which provides nonrepudiation and non-transferability simultaneously. However, the initial chameleon hash schemes suffer from the key exposure problem: non-transferability is ...
An efficient handoff decision algorithm for vertical handoff between WWAN and WLAN
Vertical handoff is one significant challenge for mobility management in heterogeneous wireless networks. Compared with horizontal handoff, vertical handoff involves different wireless network technologies varying widely in terms of bandwidth, delay, ...
FloodNet: coupling adaptive sampling with energy aware routing in a flood warning system
We describe the design of FloodNet, a flood warning system, which uses a grid-based flood predictor model developed by environmental experts to make flood predictions based on readings of water level collected by a set of sensor nodes. To optimize ...
An efficient data dissemination scheme for spatial query processing
Due to the personal portable devices and advances in wireless communication technologies, Location Dependent Information Services (LDISs) have received a lot of attention from both the industrial and academic communities. In LDISs, it is important to ...
End-to-end utilization control for aperiodic tasks in distributed real-time systems
An increasing number of DRTS (Distributed Real-Time Systems) are employing an end-to-end aperiodic task model. The key challenges of such DRTS are guaranteeing utilization on multiple processors to achieve overload protection, and meeting the end-to-end ...
3D morphing using strain field interpolation
In this paper, we present a new technique based on strain fields to carry out 3D shape morphing for applications in computer graphics and related areas. Strain is an important geometric quantity used in mechanics to describe the deformation of objects. ...
Visual simulation of multiple unmixable fluids
We present a novel grid-based method for simulating multiple unmixable fluids moving and interacting. Unlike previous methods that can only represent the interface between two fluids (usually between liquid and gas), this method can handle an arbitrary ...
A Markov random field model-based approach to natural image matting
This paper proposes a Markov Random Field (MRF) model-based approach to natural image matting with complex scenes. After the trimap for matting is given manually, the unknown region is roughly segmented into several joint sub-regions. In each sub-region,...