Show simple item record

dc.contributor.authorChristianson, B.
dc.contributor.authorShafarenko, A.
dc.date.accessioned2013-01-28T16:58:30Z
dc.date.available2013-01-28T16:58:30Z
dc.date.issued2009
dc.identifier.citationChristianson , B & Shafarenko , A 2009 , ' Vintage Bit Cryptography ' , Lecture Notes in Computer Science , vol. 5087 , pp. 261-265 . https://doi.org/10.1007/978-3-642-04904-0_34
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 95944
dc.identifier.otherPURE UUID: 35a6a8c9-9c0b-4d6f-a7eb-aed26a3a1c8e
dc.identifier.otherdspace: 2299/4196
dc.identifier.otherScopus: 71549114183
dc.identifier.urihttp://hdl.handle.net/2299/9789
dc.description.abstractWe propose to use a Random High-Rate Binary (RHRB) stream for the purpose of key distribution. The idea is as follows. Assume availability of a high-rate (terabits per second) broadcaster sending random content. Members of the key group (e.g. {Alice, Bob}) share a weak secret (at least 60 bits) and use it to make a selection of bits from the RHRB stream at an extremely low rate (1 bit out of 1016 to 1018). By the time that a strong key of reasonable size has been collected (1,000 bits), an enormous amount of data has been broadcast (1019 − 1021 bits). This is 106 to 108 times current hard drive capacity, which makes it infeasible for the interceptor (Eve) to store the stream for subsequent cryptanalysis, which is what the interceptor would have to do in the absence of the shared secret. Alternatively Eve could record the selection of bits that correspond to every value of the weak shared secret, which under the above assumptions requires the same or greater amount of storage i.e. 260×103. The members of the key group have no need to capture the whole stream, but store only the tiny part of it that is the key. Effectively this allows a pseudo-random sequence generated from a weak key to be leveraged up into a strong genuinely random key.en
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science
dc.rightsOpen
dc.titleVintage Bit Cryptographyen
dc.contributor.institutionSchool of Computer Science
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeSubmitted Version
dcterms.dateAccepted2009
rioxxterms.versionVoR
rioxxterms.versionSMUR
rioxxterms.versionofrecordhttps://doi.org/10.1007/978-3-642-04904-0_34
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record