| dc.contributor.author | Christianson, B. | |
| dc.contributor.author | Crispo, B. | |
| dc.contributor.author | Malcolm, J. | |
| dc.date.accessioned | 2010-03-17T13:54:26Z | |
| dc.date.available | 2010-03-17T13:54:26Z | |
| dc.date.issued | 2001 | |
| dc.identifier.citation | Christianson , B , Crispo , B & Malcolm , J 2001 , ' Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms ' , Lecture Notes in Computer Science (LNCS) , vol. 2133 , pp. 182-193 . https://doi.org/10.1007/3-540-44810-1_24 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.other | dspace: 2299/4350 | |
| dc.identifier.other | ORCID: /0000-0002-3777-7476/work/76728332 | |
| dc.identifier.uri | http://hdl.handle.net/2299/4350 | |
| dc.description | “The original publication is available at www.springerlink.com”. Copyright Springer. | |
| dc.description.abstract | The 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.format.extent | 1273397 | |
| dc.language.iso | eng | |
| dc.relation.ispartof | Lecture Notes in Computer Science (LNCS) | |
| dc.title | Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms | en |
| dc.contributor.institution | School of Computer Science | |
| dc.contributor.institution | Science & Technology Research Institute | |
| dc.description.status | Peer reviewed | |
| rioxxterms.versionofrecord | 10.1007/3-540-44810-1_24 | |
| rioxxterms.type | Journal Article/Review | |
| herts.preservation.rarelyaccessed | true | |
