| dc.contributor.author | FARRELL, STEPHEN | |
| dc.date.accessioned | 2010-04-21T16:44:01Z | |
| dc.date.available | 2010-04-21T16:44:01Z | |
| dc.date.issued | 2009 | |
| dc.date.submitted | 2009 | en |
| dc.identifier.citation | Farrell, S., Keys don't grow in threes, IEEE Internet Computing, 13, 3, 2009, 96 - 95 | en |
| dc.identifier.other | Y | |
| dc.description | PUBLISHED | en |
| dc.description.abstract | Many 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 201 | en |
| dc.format.extent | 96 - 95 | en |
| dc.language.iso | en | en |
| dc.publisher | IEEE | en |
| dc.relation.ispartofseries | IEEE Internet Computing | en |
| dc.relation.ispartofseries | 13 | en |
| dc.relation.ispartofseries | 3 | en |
| dc.rights | Y | en |
| dc.subject | Internet security mechanisms | en |
| dc.subject | cryptographic algorithms | en |
| dc.title | Keys don't grow in threes | en |
| dc.type | Journal Article | en |
| dc.type.supercollection | scholarly_publications | en |
| dc.type.supercollection | refereed_publications | en |
| dc.identifier.peoplefinderurl | http://people.tcd.ie/sfarrel6 | |
| dc.identifier.rssinternalid | 64033 | |
| dc.identifier.rssuri | http://dx.doi.org/10.1109/MIC.2009.64 | en |
| dc.identifier.uri | http://hdl.handle.net/2262/39151 | |
