HARISH HARIKRISHNAN

OBJECTIVE: To obtain a long term challenging position in the IT sector where my sound technical knowledge & skills are fully optimized towards the growth of the organization and self-development. MISSION: To innovate and Develop Software Applications on a high standard. ISION:

Ta!ing technolog" to the world and invent new techni#$es.

MY EDUCATION: FRESHER SOFTWARE DEVELOPER (2012) SECONDARY 2006 HI$HER SECONDARY 2008 $RADUATION (ECE) 2012 SRI RAMAKRISHNA MISSION ST.J S!"#$S S%# & 8 !"# '(.()* 2.'%0",

+,,+,&&,- I-STIT.T! / T!%#- & 01

M% SKI&&S:
OO'S:
Strong knowledge in "S concept. (A A: ,bility to code an entire application on a single hand in 3ava. PROJECTS DONE IN JAVA: #ave written logic for solving Sudoku on single hand. 4eveloped a website using 3ava swing controls

(A A S)IN*:
Shouldering web development using 3ava swing.

(+,,:
&earnt 35ee and its applications.

(D-.:
&earnt the concepts of Java database connectivity.

HTM&:
#ave hands on #1"!6 T!7T +,68." &,-0.,0! and %,S%,4I-0 ST1&! S#!!TS.

(A A S.RI'T:
&earnt to develop dynamic webpages using 3ava script.

N,T)ORKS:
&earnt all basic concepts of networks and operating systems.

T%'IST:
%an type 5( to )9 words in a minute. AR,AS O/ INT,R,ST: :eb development

0ame development ,pplication development.

STR,N*TH:
Innovator %oming hard at my mistakes ;ending back to complete pro3ect on time Strongly believe in self motivation and confidence Team player :ork at any environment

HO--I,S:
&earning new software languages and updating knowledge :atching cricket 6eading books %oding for an application and developing websites. PROJECT DETAILS: ACADEMIC PROJECT PROJECT TITLE: Sea algorithm using cam SUMMARY: S!, is a scalable encryption algorithm targeted for small-embedded applications. It was initially designed for software implementations in controllers< smart cards or processors. In this letter< we investigate its performances in recent field-programmable gate array =/"0,> devices using content addressable memory called %,+. +ost memory devices store and retrieve data by addressing specific memory locations. The time re?uired to-find an item stored in memory will be reduced considerably if the item can be identified for access by its content rather than by its address. , memory that is accessed in this way is called content-addressable memory .In addition to the performance evaluation< we show that the algorithm$s scalability can be turned into a fully generic @#4& design< so that any teAt< key< and bus size can be straightforwardly re-implemented without any modification of the hardware description language< with standard synthesis and implementation tools. PERSONAL DETAILS:
NAME: FATHERS NAME: MOTHERS NAME: MOBILE NO: EMAIL ADDRESS: DATE OF BIRTH: LANGUAGES KNOWN: DECLARATION: HARISH.H HARIKRISHNAN.B GEETHA.H 8526 8!8"#$"!!%2!#2#2$" "#6&%%8! 'ar(mate#%)gmail.com #%*& *#""# TA+I, TE,-G-$ ENG,ISH

I hereby declare that the details furnished above are true to the best of my knowledge and belief. #,6IS#.#