مواقع التدريسيينجامعة الكوفة
zainalabden abdulsamad rashed saltan
Assistant Professor

zainalabden abdulsamad rashed saltan

0Publications
0Lectures

About

First Name: Zain alabideen
Surname: saltan
Residential Address: Iraq/Baghdad/Our section
Postal Address: Street 17 / no 35
E-Mail Address: [email protected]
Phone Numbers: 009647711131246
Date of Birth: 05. 12. 1974
Languages: Arabic, English

EDUCATION

Year of completion: 2001

Educational level: Bch science of computer
School/College: Baghdad university/Iraq
Year of completion: 2012
Educational level: MSc in Innovative of computing/ computer of science
School/College: the university Buckingham/United kingdom
Teaching Interest
1-Image Processing
2-Data Security
3-Mobile Communication
4-Programing and Data Structure
5-Operating System
6-Data mining and Data base
7-Artificial Inelegance
8- Compiler

Research interested
1-applying different apps of communications
2- Applying new steganography algorithms using digital files.
3-new cryptography algorithms
4-Image processing techniques
Publication for future
Improving steganography LSB method using Fibonacci sequence
Generating public key

WORK

Assistant . Lecturer
Kufa University – faculty of education
Computer Science Department

Publications

9
2016

An Adaptive Use of Deffie Hellman Algorithm by Digital Images for Generating Secure Shared key

AuthorsZainalabideen Abdullsamd Rasheed
JournalInternational Journal of Science and Research (IJSR)
Abstract

Abstract: security is one of the most imperative commentaries in contemporary era. Especially, in terms of creating a safe channel. Create secure channel means the protection of information against an invader during exchanging the data through channel. Many procedures suggested overcoming this problem like cryptography, steganography, biometrics ….etc. In this paper, the propose system consist of two stages: the first is generated key called image key from an image while the second stage is applied Diffie Hellman based on the key which is created from the first step. The image key in our system is used instead of the two numbers which are needed compulsory in Hilleman algorithm. . In our proposal two client will not need to agree previously about the two numbers (prime and integer) which are basically the requirements in d,h algorithm to generate the shared key which should be used in ciphering process in advance. Moreover, the exchange key as a part of Diffie Hellman algorithm will be exchanged between parties through hiding it in own copy image of each party in specific position which are selected based on image key that are created in the first stage .The hiding process support a secure channel for two parties to exchange their keys securely. Moreover, support securely channel is done with keeping quality of stego- image due to limitation pixels which are used for hiding process.in addition the hiding process is applied in high bit plane 8th lsb to make it immune against channel effected like noise or compression. The system has been proved truly and the image key generated completely and exchange keys exchanged truly even if the channel has some effect on image like noise or compression.

2016

4846ISSN 2286-4822www.euacademic.orgEUROPEAN ACADEMIC RESEARCHVol. IV, Issue 5/ August2016Impact Factor: 3.4546(UIF)DRJI Value: 5.9 (B+)Colored Image Ciphering with Key Image

AuthorsZAINALABIDEEN ABDULLASAMD RASHEED
JournalEUROPEAN ACADEMIC RESEARCH
Abstract

Abstract: Security is one of the most important thingsin current era especially in sending information in unsecured channel, because of thedanger of attack the information during passing channel, many methods suggested to overcome this problem like cryptography, steganography, passwords, biometrics, barcode,......... each one of them contain a wide range of precisecorrect algorithmslike public key algorithms, substitution algorithms, polyalphabetic algorithms, DES algorithms, ......... in cryptography and so on in other methods. The proposed system cipher colored image by using information scrambling between bands of colored image firstly,then x-orwith number which is seen random but it is related to position of the pixel and the band of the colored image after that the result number will be x-ored with special key that discovered from another image. The key will be constructing by scanning image from start to end line after line andconsidering the sequence of pixels appearance as a colored key instead of original color of the pixel.

2015

A Novel Approach for Hiding Huge Data in Image

AuthorsZAINALABIDEEN ABDUAL SAMAD RASHEED , ZAINA HUSSAN KADIM SAMI KADHEM ALTHABHAWI
JournalEUROPEAN ACADEMIC RESEARCH
Abstract

Steganography is an important area of research in recent years involving a number of applications. It is the science of embedding information into the cover images viz. text, video, and images. Various Steganography methods have been applied in terms of robustness, Imperceptibility (stego-image), and capacity. However, most of hiding image in image focus on capacity and Imperceptibility (image quality) and most of them need cover image to be 8 times bigger than secret image, for that reason this project focus on apply new techniques to reduce the size of cover image requiring by insert 4 bits in each pixel instead of one with mention to image quality. The quality of cover image is considered high due to the inserting process by add the message or inverse of message. Moreover, selecting a suitable pixel within the same block case less change to the cover image and keep quality of cover image too

2015

Comparative Study for Steganography Techniques

AuthorsZainalabideenAbdual Samad Rasheed
JournalInternational Journal of Science and Research (IJSR)
Abstract

Abstract:Varioussteganographytechniques for hidinginformationhavebeencreated.Steganographyistheartorscienceofhidingdatainsuch a meansthateventhereceivercannotestimatethepresenceoftheunseendataexceptheisresponsiveoftheaccomplishmentofhidingletter.The whole awarenessofsteganographyistoguaranteethatthetransferredmessageisfullycovered;bythismeansmakesurethatthemessageisreachableonlytotheintentionalreceiver.Steganographygenerate a protectedchanneltoexchangethetop-secretinformationbetween two parties.Inthisproject,several steganographytechniqueshavebeenanalyzed.Themainideaoftheprojectistointroduceanoverviewofimagesteganographytoidentifytherequirementsof a goodsteganographyapproachthetermsofgoodapproachisapplicationdepended.ingeneralThismethodologyshouldbeabletohide a secretmessageinanimagefile(coverimage)andshouldalsobeabletoextractthehiddeninformationfromthecoverimage..

2015

Steganography Technique forBinaryTextImage

AuthorsZainalabideen AbdualSamad Rasheed
JournalInternational Journal of Science and Research (IJSR)
Abstract

Abstract: Inlastdecadesdifferenttechniqueshavebeencreated for hidinginformation. Theroleofhidinginformationistocreate a securecommunicationbetweenauthorizepartiesintermsofexchangetheirvitaldatainsafechannel.Steganographyis a methodofhidingdatainsuchanapproachnoonecanfeelthereis a hiddendataorfoundit.I.e.Onlytheauthorizepartycanextractthesedatabecauseheknowtheachievementofhidinginformation.inthispaper,anefficientmethodofhidingbinarytextimageviaanoptimalusingofFibonaccisequence.Digitalimageisconsideredtobethecoverimage. A binarytextimageisusedtorepresentthesecretmessageinsteadofnormaltext.Thismethodisused for thepurposeofhaving a chancetoreadthebinarytextimageifshouldanymodificationhappenalong thecommunicationchannel. (E.g. JPEG compression). A binarytextimageisanimagewhichincludes a textandcanbeconstructbyusinganysoftwareforimageprocessinglikepaint.

2015

A Novel Method of Generating (Stream Cipher) Keys for Secure Communication

AuthorsZainalabideenAbdullasamdRasheed , Ali Abdul Azeez Mohammad Baker
JournalIOSR Journal of Computer Engineering (IOSR-JCE)
Abstract

Abstract:Securityis an important part of computer science that deals with the protection of important information from access, change or modified, and delete, so there are many ways to improve the security of information like cryptography, steganography, biometrics, passwords, barcode..... Howevermostof these methods are consideredkeysrequired.These keys are used toimplement the changing of the information forsecure stylepurpose. For that reason, generating and keeping thesekeys isa major part of theappropriate securitysystem. Moreover, sending the key to the wanted person in unsacred channelis a widelyweakness part forany system. The proposed systemis a novel methodfor generating asecret unique key from an image. A generating process is appliedby discovering the essential colors in the image and constructing a table values for these essential colors , after that asuitable thresholdis usedto considered thesevalues are(0, 1)bitswhich will be used as stream bits key

2015

Image ciphering using position related matrix

AuthorsZainalabideen Abdullasamd Rasheed, Ali Abdul Azeez Mohammad Baker
JournalInternationalJournalOf Advances inEngineeringand Management(IJAEM)
Abstract

ABSTRACT: image security is important part from security field in computer science because of the importunate needing for protecting image information against any third part or any eavesdropped person in the transform channel, so many algorithm proposed for ciphering image each one of them has its strong properties in some sides with some weak sides that exploit from hackers to brock or predict whole or parts of original image. The proposed system consist of two important steps, the first one rearranged bits values for each pixel in the image in deterministic fashion that can be reflected in extracting stage while the second step is x-oring pixels in the image with non-similar values that depend on the pixel position by using linear equation, the proposed system used many secret keys

2014

Secure Keys Constructing

AuthorsZainalabideen Abdullasamd Rashee, Ali Abdul Azeez Mohammad Baker
JournalInternational Journal of Advanced Research inComputer Science and Software Engineering
Abstract

Abstract—Security is one of the most important things in current era because of danger effects of extracting secure information by any unwanted partwhere information is critical and effective. There are many methods applied to ensure information security like steganography, cryptography, biometrics, barcodes, and passwords, all these methods have different levels of security and havestrong and/or weak features in different cases. cryptography provide strong method for keeping information secured and undiscovered from unwanted persons, and this state depends on some parameters like method complexity, key length, key randomness,andkey security. In this paper a new method will be suggested to construct secure and randomness keys and avoiding the problems of changing and sending keys between authorized parts. The proposed method constructingfifteenth digit key from colored image by discovering sixteen digits from each band throughextracting the essential repetitive colors and two digits from the size of the image. the most important feature of this key that it can be reconstructed in all authorized parts that received the specific image in spite of changing could be happened through channel in the networks that will be used in sendingsecure information from one part to all other authorized parts

2014

Improving Classical Fibonacciin Steganography

AuthorsZainalabideen Abdual Samad Rashee
JournalInternational Journal of Advanced Research inComputer Science and Software Engineering
Abstract

Abstract—for many years, people have created different steganography techniques for hiding information. Steganography is a method of hiding information in such a way that even the recipient cannot guess the existence of the hidden information unless he is aware of the action of hiding message. The purpose of steganography is to allow a secure communication between two parties to exchange their secret message in a safe way. This achieves privacy and protects data from being altered.Inthis paper animprovement of classical Fibonacci has been made to solve the limitation of this method.the limitation of classical Fibonacci case by Zeckendrof theorem.Thisimprovement leads to increase capacity of hidingby making all pixelsvaluesin cover file goodcandidates for hiding. Anddecrease time of steganography algorithm as well asnot keyrequiring.

Lectures

2

function

برمجة كيانية

برمجة كيانية

View details