Results 1  10
of
164,428
TEA, a Tiny Encryption Algorithm.
, 1995
"... Introduction We design a short program which will run on most machines and encypher safely. It uses a large number of iterations rather than a complicated program. It is hoped that it can easily be translated into most languages in a compatible way. The first program is given below. It uses little ..."
Abstract

Cited by 29 (0 self)
 Add to MetaCart
Introduction We design a short program which will run on most machines and encypher safely. It uses a large number of iterations rather than a complicated program. It is hoped that it can easily be translated into most languages in a compatible way. The first program is given below. It uses little set up time and does a weak non linear iteration enough rounds to make it secure. There are no preset tables or long set up times. It assumes 32 bit words. Encode Routine Routine, written in the C language, for encoding with key k[0]  k[3]. Data in v[0] and v[1]. void code(long* v, long* k)  unsigned long y=v[0],z=v[1], sum=0, /* set up */ delta=0x9e3779b9, n=32 ; /* a key schedule constant */ while (n?0)  /* basic cycle start */ sum += delta ; y += (z!!4)+k[0] z+sum (z??5)+k[1] ; z += (y!!4)+k[2] y+sum (y??5)+k[3] ; /* end cycle */ v[0]=y ; v[1]=z ; Basics of the routine It is a Feistel type routine although addition and subtraction a
GPU Random Numbers via the Tiny Encryption Algorithm
, 2010
"... Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) are expected to cater general purpose and graphics applications alike. Such diversity adds to expected requirements of a R ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
that not all algorithms need the highestquality random numbers, so a good GPU RNG should provide a speed quality tradeoff that can be tuned for fast low quality or slower high quality random numbers. We propose that the Tiny Encryption Algorithm satisfies all of the requirements of a good GPU Pseudo Random
Index Terms — Extended Tiny Encryption Algorithm
"... called Nmix is used to replace addition modulo 232.Proposed design has been implemented on a FPGA platform. Simulation result shows that it requires a reasonable hardware and provides an acceptable throughput. It is shown that proposed design requires less hardware compared to XTEA. ..."
Abstract
 Add to MetaCart
called Nmix is used to replace addition modulo 232.Proposed design has been implemented on a FPGA platform. Simulation result shows that it requires a reasonable hardware and provides an acceptable throughput. It is shown that proposed design requires less hardware compared to XTEA.
IMPLICATIONS OF BITSUM ATTACK ON TINY ENCRYPTION ALGORITHM AND XTEA
"... TEA and XTEA are block ciphers that uses Fiestal structure. We enciphered a fixed message with different keys using TEA and XTEA cryptographic algorithms. Our interest was to find the correlation of the bitsum of the ciphertext with the bitsums of the corresponding keys. In our attempt, we found tha ..."
Abstract
 Add to MetaCart
TEA and XTEA are block ciphers that uses Fiestal structure. We enciphered a fixed message with different keys using TEA and XTEA cryptographic algorithms. Our interest was to find the correlation of the bitsum of the ciphertext with the bitsums of the corresponding keys. In our attempt, we found
DEMITASSE: A “SMALL ” VERSION OF THE TINY ENCRYPTION ALGORITHM AND ITS USE IN A CLASSROOM SETTING
"... Abstract. This paper describes Demitasse, a cipher which is intended to be used by inexperienced students in a classroom setting. The cipher is based on the Tiny Encryption Algorithm (TEA), but the parameters have been reduced in order to allow the students to operate the cipher with paper and penci ..."
Abstract
 Add to MetaCart
Abstract. This paper describes Demitasse, a cipher which is intended to be used by inexperienced students in a classroom setting. The cipher is based on the Tiny Encryption Algorithm (TEA), but the parameters have been reduced in order to allow the students to operate the cipher with paper
Available online at: www.ijarcsse.com Improved Secure Data Transfer Using Tiny Encryption Algorithm and Video Steganography
"... Abstract: The “Secure data transfer ” is a web application which deals with security during transmission of data. Security for the data is required, as there is always a chance for someone to read those secret data. The security is implemented by using steganography. Steganography is the good art of ..."
Abstract
 Add to MetaCart
of hiding information in ways so as to prevent detection of hidden messages. This paper designs software which tries to alter the originality of the data files into encrypted form using Tiny Encryption Algorithm.This Algorithm is to be designed for simplicity and better performance. In an encryption scheme
Maté: A Tiny Virtual Machine for Sensor Networks
, 2002
"... Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopulate. ..."
Abstract

Cited by 502 (21 self)
 Add to MetaCart
Composed of tens of thousands of tiny devices with very limited resources ("motes"), sensor networks are subject to novel systems problems and constraints. The large number of motes in a sensor network means that there will often be some failing nodes; networks must be easy to repopu
Contiki  a Lightweight and Flexible Operating System for Tiny Networked Sensors
, 2004
"... of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs and servi ..."
Abstract

Cited by 497 (43 self)
 Add to MetaCart
of tiny networked devices that communicate untethered. For large scale networks it is important to be able to dynamically download code into the network. In this paper we present Contiki, a lightweight operating system with support for dynamic loading and replacement of individual programs
Fully homomorphic encryption using ideal lattices
 In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract

Cited by 642 (17 self)
 Add to MetaCart
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Results 1  10
of
164,428