Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/13602
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | RAGHAV, NIDHI | - |
dc.date.accessioned | 2011-04-13T09:57:27Z | - |
dc.date.available | 2011-04-13T09:57:27Z | - |
dc.date.issued | 2008-06-12 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/13602 | - |
dc.description | ME THESIS | en_US |
dc.description.abstract | Bluetooth is an open specification for seamless wireless short range communication of data and voice between devices. It uses radio waves to transfer information, so it is very susceptible to attacks. Bluetooth also has security architecture. The Bluetooth authentication protocol is based on symmetric key cryptography and on a typically numeric and short password called pin or passkey that the user enters into both devices. The protocol is vulnerable to a passive attack in which the eavesdropper brute forces the pin, and then it can recover the link keys shared by two devices. With this secret key any encrypted traffic can be decrypted between the devices as well as, potentially, impersonate the devices to each other. So, a protocol is needed which should be robust against pin guessing attack that means if pin or passkey is guessed by intruder it should be difficult to crack the initialization, link and encryption keys. This dissertation discusses the approach to improve pairing protoc... | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD 402;94 | - |
dc.subject | Bluetooth Security | en_US |
dc.subject | Algorithm | en_US |
dc.subject | BLUETOOTH | en_US |
dc.title | A IMPROVED INITIALIZATION ALGORITHM FOR SECURE PAIRING IN BLUETOOTH | en_US |
Appears in Collections: | M.E./M.Tech. Computer Technology & Applications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
final_thesis_24_june+JMD.doc | 3.23 MB | Microsoft Word | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.