Show simple item record

dc.contributor.authorFARRELL, STEPHEN
dc.date.accessioned2010-04-21T16:44:01Z
dc.date.available2010-04-21T16:44:01Z
dc.date.issued2009
dc.date.submitted2009en
dc.identifier.citationFarrell, S., Keys don't grow in threes, IEEE Internet Computing, 13, 3, 2009, 96 - 95en
dc.identifier.otherY
dc.identifier.urihttp://hdl.handle.net/2262/39151
dc.descriptionPUBLISHEDen
dc.description.abstractMany Internet security mechanisms depend on the use of cryptographic algorithms for various forms of authentication and confidentiality. Even when well-known and standardized cryptographic algorithms are used in well-known protocols, some parameters must be specified, the most important of which are usually algorithm identifiers and key or hash-output lengths. The author reviews some recent key length recommendations and compares those to current usage. He raises some issues that come up once we start to do the updates called for by various cryptographic experts and authorities who've made recommendations on this topic - some of which call for widespread changes to occur in 201en
dc.format.extent96 - 95en
dc.language.isoenen
dc.publisherIEEEen
dc.relation.ispartofseriesIEEE Internet Computingen
dc.relation.ispartofseries13en
dc.relation.ispartofseries3en
dc.rightsYen
dc.subjectInternet security mechanismsen
dc.subjectcryptographic algorithmsen
dc.titleKeys don't grow in threesen
dc.typeJournal Articleen
dc.type.supercollectionscholarly_publicationsen
dc.type.supercollectionrefereed_publicationsen
dc.identifier.peoplefinderurlhttp://people.tcd.ie/sfarrel6
dc.identifier.rssinternalid64033
dc.identifier.rssurihttp://dx.doi.org/10.1109/MIC.2009.64en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record