Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms

B. Christianson; B. Crispo; J. Malcolm

doi:10.1007/3-540-44810-1_24

Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms

B. Christianson, B. Crispo, J. Malcolm

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

60 Downloads (Pure)

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.

Original language	English
Pages (from-to)	182-193
Journal	Lecture Notes in Computer Science (LNCS)
Volume	2133
DOIs	https://doi.org/10.1007/3-540-44810-1_24
Publication status	Published - 2001

Access to Document

10.1007/3-540-44810-1_24

201404141252Submitted manuscript, 1.21 MB

Cite this

@article{19b55df3e49e44f29deb157951bd68c7,

title = "Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms",

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.",

author = "B. Christianson and B. Crispo and J. Malcolm",

note = "“The original publication is available at www.springerlink.com”. Copyright Springer. ",

year = "2001",

doi = "10.1007/3-540-44810-1_24",

language = "English",

volume = "2133",

pages = "182--193",

journal = "Lecture Notes in Computer Science (LNCS)",

issn = "0302-9743",

publisher = "Springer Nature ",

}

TY - JOUR

T1 - Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms

AU - Christianson, B.

AU - Crispo, B.

AU - Malcolm, J.

N1 - “The original publication is available at www.springerlink.com”. Copyright Springer.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-44810-1_24

DO - 10.1007/3-540-44810-1_24

M3 - Article

SN - 0302-9743

VL - 2133

SP - 182

EP - 193

JO - Lecture Notes in Computer Science (LNCS)

JF - Lecture Notes in Computer Science (LNCS)

ER -

Public-Key Crypto-systems Using Symmetric-Key Crypto-algorithms

Abstract

Access to Document

Fingerprint

Cite this