Show simple item record

dc.contributor.authorChristianson, B.
dc.contributor.authorCrispo, B.
dc.contributor.authorMalcolm, J.
dc.date.accessioned2010-03-17T13:54:26Z
dc.date.available2010-03-17T13:54:26Z
dc.date.issued2001
dc.identifier.citationChristianson , B , Crispo , B & Malcolm , J 2001 , ' Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms ' Lecture Notes in Computer Science , vol. 2133 , pp. 182-193 . https://doi.org/10.1007/3-540-44810-1_24
dc.identifier.issn0302-9743
dc.identifier.otherPURE: 102907
dc.identifier.otherPURE UUID: 19b55df3-e49e-44f2-9deb-157951bd68c7
dc.identifier.otherdspace: 2299/4350
dc.identifier.otherScopus: 84949941038
dc.identifier.urihttp://hdl.handle.net/2299/4350
dc.description“The original publication is available at www.springerlink.com”. Copyright Springer.
dc.description.abstractThe prospect of quantum computing makes it timely to consider the future of public-key crypto-systems. Both factorization and discrete logarithm correspond to a single quantum measurement, upon a superposition of candidate keys transformed into the fourier domain. Accordingly, both these problems can be solved by a quantum computer in a time essentially proportional to the bit-length of the modulus, a speed-up of exponential order.en
dc.language.isoeng
dc.relation.ispartofLecture Notes in Computer Science
dc.rights/dk/atira/pure/core/openaccesspermission/open
dc.titlePublic-Key Crypto-systems Using Symmetric-Key Crypto-algorithmsen
dc.contributor.institutionSchool of Computer Science
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Computer Science
dc.description.versiontypeSubmitted Version
rioxxterms.versionSMUR
rioxxterms.versionofrecordhttps://doi.org/10.1007/3-540-44810-1_24
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstyperestrictedAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record