This paper describes a program of research that would allow the size, characteristics, and geographic distribution of the "hardcore" population of drug users in the United States to be monitored over time. The program is conceived as a complement to and extension of existing federal data collection initiatives. It involves the development of mathematical models of drug use careers, and the use ...

In this paper, we propose an FPGA cluster infrastructure, which can be utilized in implementing cryptanalytic attacks and accelerating cryptographic operations. The cluster can be formed using simple and inexpensive, off-the-shelf FPGA boards featuring an FPGA device, local storage, CPLD, and network connection. Forming the cluster is simple and no effort for the hardware development is needed ...

This paper discusses the design and implementation of a system-level mechanism and corresponding applicationlevel support that enables programs running on a reconfigurable SoC to modify the underlying FPGA at runtime. Applications may request the addition and/or removal of softcore devices at any point in time. Requests are handled in a coordinated way via a separate user-level process that fet...

In the world of social media video processing is very popular. A video signal is the term used to describe any sequence of time varying images. This paper presents the architectures for Video Processing algorithm using softcore processor. This hardware/software co-design platform has been implemented on a Xilinx Virtex-5 FPGA (XUPV5-LX110T). Field Programmable Gate Array (FPGA) offers various r...

Proof: The proof of this lemma uses a technique called as Padding which has has its roots in complexity theory. Let fk : {0, 1} → {0, 1} be one-way. From the property of one-way functions (efficient evaluation) there exists a specific polynomial p(·) such that for all k ∈ N, fk can be evaluated in time p(n(k)). We now define a function gk : {0, 1} → {0, 1}m(k)+p(n(k))−n(k) such that gk(x||w) = ...

This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the “memory attack”, was proposed recently. In this attack, a significant fraction of the bits of a secret key of a cryptographic algorithm can be measured by an adversary if the secret key is ever stored in a part of memory...

Error Correcting Codes and Hardcore Predicates Error correcting codes (ECC) play an important role in both complexity theory and cryptography. For our purposes let an ECC be a mapping C : {0, 1} → {0, 1} (more generally the source and target alphabets can be arbitrary finite sets), such that if a string y which is close to a valid encoding C(x) is given, then it is possible to reconstruct the m...

Levels of hardcore drug use have been especially difficult to estimate because of the relative rarity of the behavior, the difficulty of locating hardcore drug users, and the tendency to underreport stigmatized behavior. This chapter presents a new application of ratio estimation, combining sample data from the National Household Survey on Drug Abuse (NHSDA) together with population counts of t...

In this paper we present a software-based mechanism that enables concurrently executing applications to deploy hardware accelerator modules on FPGA at runtime, properly managing requests under resource scarcity. We describe our implementation on a softcore system-on-chip platform, and present experimental results that show the importance of runtime reconfiguration and the policy used to group a...