Dynamic Circuit Specialisation for Key-Based Encryption Algorithms and DNA Alignment
نویسندگان
چکیده
منابع مشابه
Dynamic Circuit Specialisation for Key-Based Encryption Algorithms and DNA Alignment
Parameterised reconfiguration is a method for dynamic circuit specialization on FPGAs. The main advantage of this new concept is the high resource efficiency. Additionally, there is an automated tool flow, TMAP, that converts a hardware design into a more resource-efficient run-time reconfigurable design without a large design effort. We will start by explaining the core principles behind the d...
متن کاملDynamic Key Exchange Method for Image Encryption
In recent years, a variety of image encryption scheme has been proposed. A new color image encryption method based on dynamic key exchange is proposed in this paper. For real time image encryption and lesser amount of time. The algorithm lacks of the characteristic of diffusion because each pixel is operated individually and a chosen/known-plaintext attack can break the scheme. The 192-bit-long...
متن کاملDynamic Threshold Public-Key Encryption
This paper deals with threshold public-key encryption which allows a pool of players to decrypt a ciphertext if a given threshold of authorized players cooperate. We generalize this primitive to the dynamic setting, where any user can dynamically join the system, as a possible recipient; the sender can dynamically choose the authorized set of recipients, for each ciphertext; and the sender can ...
متن کاملDynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints
Pairwise local alignment is one of the most important problems in sequence analysis in computational biology. Classical dynamic programming solution to this problem searches for two segments with maximum similarity score by discarding poorly conserved initial and terminal fragments. As a consequence, an alignment returned as optimal may contain a mosaic of well-conserved fragments arti cially c...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Reconfigurable Computing
سال: 2012
ISSN: 1687-7195,1687-7209
DOI: 10.1155/2012/716984