An Approach Towards The Development Of An Efficient Symmetric Key Encryption Scheme

n the recent years protection of information in digital form is becoming more important. Image and video encryption has applications in various fields including Internet communications, multimedia systems, medical imaging, Tele-medicine and military communications. During storage as well as in transmission, the multimedia information is being exposed to unauthorized entities unless otherwise adequate security measures are built around the information system. There are many kinds of security threats during the transmission of vital classified information through insecure communication channels. Various encryption schemes are available today to deal with information security issues. Data encryption is widely used to protect sensitive data against the security threat in the form of “attack on confidentiality”. Secure transmission of information through insecure communication channels also requires encryption at the sending side and decryption at the receiving side. Encryption of large text message and image takes time before they can be transmitted, causing considerable delay in successive transmission of information in real-time. In order to minimize the latency, efficient encryption algorithms are needed. An encryption procedure with adequate security and high throughput is sought in multimedia encryption applications. Traditional symmetric key block ciphers like Data Encryption Standard (DES), Advanced Encryption Standard (AES) and Escrowed Encryption Standard (EES) are not efficient when the data size is large. With the availability of fast computing tools and communication networks at relatively lower costs today, these encryption standards appear to be not as fast as one would like. High throughput encryption and decryption are becoming increasingly important in the area of high-speed networking. Fast encryption algorithms are needed in these days for high-speed secure communication of multimedia data. It has been shown that public key algorithms are not a substitute for symmetric-key algorithms. Public key algorithms are slow, whereas symmetric key algorithms generally run much faster. Also, public key systems are vulnerable to chosen plaintext attack. In this research work, a fast symmetric key encryption scheme, entitled “Matrix Array Symmetric Key (MASK) encryption” based on matrix and array manipulations has been conceived and developed. Fast conversion has been achieved with the use of matrix table look-up substitution, array based transposition and circular shift operations that are performed in the algorithm. MASK encryption is a new concept in symmetric key cryptography. It employs matrix and array manipulation technique using secret information and data values. It is a block cipher operated on plain text message (or image) blocks of 128 bits using a secret key of size 128 bits producing cipher text message (or cipher image) blocks of the same size. This cipher has two advantages over traditional ciphers. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the key avalanche effect produced in the ciphertext output is better than that of AES.

A public key encryption based on third order linear sequences

Based on third order linear sequences, an improvement version of the Diffie-Hellman distribution key scheme and the ElGamal public key cryptosystem scheme are proposed, together with an implementation and computational cost. The security relies on the difficulty of factoring an RSA integer and on the difficulty of computing the discrete logarithm.

Matrix based Cryptographic Procedure for Efficient Image Encryption

In this paper we propose a cryptographic transformation based on matrix manipulations for image encryption. Substitution and diffusion operations, based on the matrix, facilitate fast conversion of plaintext and images into ciphertext and cipher images. The paper describes the encryption algorithm, discusses the simulation results and compares with results obtained from Advanced Encryption Standard (AES). It is shown that the proposed algorithm is capable of encrypting images eight times faster than AES.

Matrix Power S-box Analysis

* Work supported by the Lithuanian State Science and Studies Foundation.

Utilization of different encryption schemes for securing SCADA component communication

A vital role is being played by SCADA Communication for Supervisory Control and Data acquisition (SCADA) Monitoring Ststems. Devices that are designed to operate in safety-critical environments are usually designed to failsafe, but security vulnerabilities could be exploited by an attacker to disable the fail-safe mechanisms. Thus these devices must not onlybe designed for safety but also for security. This paper presents a study of the comparison of different Encryption schemes for securing SCADA Component Communication. The encryption schemes such as Symetric Key Encrypton in Wireless SCADA Environment, Assymmetric-key Encryption to Internet SCADA, and the Cross Crypto Scheme Cipher to secure communication for SCADA are analysed and the outcome is evaluated.

A Novel Fast Hybrid Cryptographic System: MARS4

A novel and fast technique for cryptographic applications is designed and developed using the symmetric key algorithm “MAJE4” and the popular asymmetric key algorithm “RSA”. The MAJE4 algorithm is used for encryption / decryption of files since it is much faster and occupies less memory than RSA. The RSA algorithm is used to solve the problem of key exchange as well as to accomplish scalability and message authentication. The focus is to develop a new hybrid system called MARS4 by combining the two cryptographic methods with an aim to get the advantages of both. The performance evaluation of MARS4 is done in comparison with MAJE4 and RSA.

Damage Characterization Using Guided-Wave Linear Arrays and Image Compounding Techniques

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Effects of enamel matrix derivative and transforming growth factor-β1 on human osteoblastic cells

Abstract Background Extracellular matrix proteins are key factors that influence the regenerative capacity of tissues. The objective of the present study was to evaluate the effects of enamel matrix derivative (EMD), TGF-β1, and the combination of both factors (EMD+TGF-β1) on human osteoblastic cell cultures. Methods Cells were obtained from alveolar bone of three adult patients using enzymatic digestion. Effects of EMD, TGF-β1, or a combination of both were analyzed on cell proliferation, bone sialoprotein (BSP), osteopontin (OPN) and alkaline phosphatase (ALP) immunodetection, total protein synthesis, ALP activity and bone-like nodule formation. Results All treatments significantly increased cell proliferation compared to the control group at 24 h and 4 days. At day 7, EMD group showed higher cell proliferation compared to TGF-β1, EMD + TGF-β1 and the control group. OPN was detected in the majority of the cells for all groups, whereas fluorescence intensities for ALP labeling were greater in the control than in treated groups; BSP was not detected in all groups. All treatments decreased ALP levels at 7 and 14 days and bone-like nodule formation at 21 days compared to the control group. Conclusions The exposure of human osteoblastic cells to EMD, TGF-β1 and the combination of factors in vitro supports the development of a less differentiated phenotype, with enhanced proliferative activity and total cell number, and reduced ALP activity levels and matrix mineralization.

Integrin α6Aβ1 Induces CD81-dependent Cell Motility without Engaging the Extracellular Matrix Migration Substrate

It is well established that integrins and extracellular matrix (ECM) play key roles in cell migration, but the underlying mechanisms are poorly defined. We describe a novel mechanism whereby the integrin α6β1, a laminin receptor, can affect cell motility and induce migration onto ECM substrates with which it is not engaged. By using DNA-mediated gene transfer, we expressed the human integrin subunit α6A in murine embryonic stem (ES) cells. ES cells expressing α6A (ES6A) at the surface dimerized with endogenous β1, extended numerous filopodia and lamellipodia, and were intensely migratory in haptotactic assays on laminin (LN)-1. Transfected α6A was responsible for these effects, because cells transfected with control vector or α6B, a cytoplasmic domain α6 isoform, displayed compact morphology and no migration, like wild-type ES cells. The ES6A migratory phenotype persisted on fibronectin (Fn) and Ln-5. Adhesion inhibition assays indicated that α6β1 did not contribute detectably to adhesion to these substrates in ES cells. However, anti-α6 antibodies completely blocked migration of ES6A cells on Fn or Ln-5. Control experiments with monensin and anti-ECM antibodies indicated that this inhibition could not be explained by deposition of an α6β1 ligand (e.g., Ln-1) by ES cells. Cross-linking with secondary antibody overcame the inhibitory effect of anti-α6 antibodies, restoring migration or filopodia extension on Fn and Ln-5. Thus, to induce migration in ES cells, α6Aβ1 did not have to engage with an ECM ligand but likely participated in molecular interactions sensitive to anti-α6β1 antibody and mimicked by cross-linking. Antibodies to the tetraspanin CD81 inhibited α6Aβ1-induced migration but had no effect on ES cell adhesion. It is known that CD81 is physically associated with α6β1, therefore our results suggest a mechanism by which interactions between α6Aβ1 and CD81 may up-regulate cell motility, affecting migration mediated by other integrins.

LocLess: Do You Really Care Where Your Cloud Files Are?

Physical location of data in cloud storage is a problem that gains a lot of attention not only from the actual cloud providers but also from the end users' who lately raise many concerns regarding the privacy of their data. It is a common practice that cloud service providers create replicate users' data across multiple physical locations. However, moving data in different countries means that basically the access rights are transferred based on the local laws of the corresponding country. In other words, when a cloud service provider stores users' data in a different country then the transferred data is subject to the data protection laws of the country where the servers are located. In this paper, we propose LocLess, a protocol which is based on a symmetric searchable encryption scheme for protecting users' data from unauthorized access even if the data is transferred to different locations. The idea behind LocLess is that "Once data is placed on the cloud in an unencrypted form or encrypted with a key that is known to the cloud service provider, data privacy becomes an illusion". Hence, the proposed solution is solely based on encrypting data with a key that is only known to the data owner.

Homomorphic encryption and database query privacy

Homomorphic encryption is a particular type of encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. In the first part of this thesis, we discuss how database search queries can be made secure using a homomorphic encryption scheme based on the ideas of Gahi et al. Gahi’s method is based on the integer-based fully homomorphic encryption scheme proposed by Dijk et al. We propose a new database search scheme called the Homomorphic Query Processing Scheme, which can be used with the ring-based fully homomorphic encryption scheme proposed by Braserski. In the second part of this thesis, we discuss the cybersecurity of the smart electric grid. Specifically, we use the Homomorphic Query Processing scheme to construct a keyword search technique in the smart grid. Our work is based on the Public Key Encryption with Keyword Search (PEKS) method introduced by Boneh et al. and a Multi-Key Homomorphic Encryption scheme proposed by L´opez-Alt et al. A summary of the results of this thesis (specifically the Homomorphic Query Processing Scheme) is published at the 14th Canadian Workshop on Information Theory (CWIT).

Esquemes de xifrat homomòrfics per a votació electrònica

This bachelor's degree thesis deals with homomorphic public-key cryptography, or in other words cryptosystems with special addition properties. Such cryptosystems are widely used in real life situations, for instance to make electronic voting secure. In Chapter 1 a few basic algebra results and other key concepts are introduced. Chapters 2 and 3 contain the algorithms and properties of the two cryptosystems which are considered to be the best for e-voting: Paillier and Joye-Libert. The thesis is concluded in Chapter 4, by comparing running times of the two above-mentioned cryptosystems, in simulations of real-life e-voting systems, with up to tens of thousands of voters, and different levels of security. Through these simulations, we discern the situations where each of the two cryptosystems is preferable.

Reconfigurable Architectures for General-Purpose Computing

General-purpose computing devices allow us to (1) customize computation after fabrication and (2) conserve area by reusing expensive active circuitry for different functions in time. We define RP-space, a restricted domain of the general-purpose architectural space focussed on reconfigurable computing architectures. Two dominant features differentiate reconfigurable from special-purpose architectures and account for most of the area overhead associated with RP devices: (1) instructions which tell the device how to behave, and (2) flexible interconnect which supports task dependent dataflow between operations. We can characterize RP-space by the allocation and structure of these resources and compare the efficiencies of architectural points across broad application characteristics. Conventional FPGAs fall at one extreme end of this space and their efficiency ranges over two orders of magnitude across the space of application characteristics. Understanding RP-space and its consequences allows us to pick the best architecture for a task and to search for more robust design points in the space. Our DPGA, a fine- grained computing device which adds small, on-chip instruction memories to FPGAs is one such design point. For typical logic applications and finite- state machines, a DPGA can implement tasks in one-third the area of a traditional FPGA. TSFPGA, a variant of the DPGA which focuses on heavily time-switched interconnect, achieves circuit densities close to the DPGA, while reducing typical physical mapping times from hours to seconds. Rigid, fabrication-time organization of instruction resources significantly narrows the range of efficiency for conventional architectures. To avoid this performance brittleness, we developed MATRIX, the first architecture to defer the binding of instruction resources until run-time, allowing the application to organize resources according to its needs. Our focus MATRIX design point is based on an array of 8-bit ALU and register-file building blocks interconnected via a byte-wide network. With today's silicon, a single chip MATRIX array can deliver over 10 Gop/s (8-bit ops). On sample image processing tasks, we show that MATRIX yields 10-20x the computational density of conventional processors. Understanding the cost structure of RP-space helps us identify these intermediate architectural points and may provide useful insight more broadly in guiding our continual search for robust and efficient general-purpose computing structures.

Caracterización de dimensiones anatómicas de la válvula mitral en diferentes patologías cardiacas mediante ecocardiografía transesofágica tridimensional

Describir mediciones 3D y hallazgos estructurales de válvula mitral, en pacientes sanos, y con insuficiencia mitral grado 3 o 4, con enfermedad coronaria, patologías degenerativas o cardiopatía dilatada no isquémica, mediante uso de ecocardiografia transesofágica 3D en tiempo real.

INFO2009 2012-13 Resource Group 18 Animation Cyber Security

Resource and flyer produced for INFO2009 12/13. An animation on public-key encryption related to cybercrime and cybersecurity. Target audience is undergraduates, but the resource does not assume prior knowledge of the topics, or any in-depth knowledge of IT.