GNU social JP
  • FAQ
  • Login
GNU social JPは日本のGNU socialサーバーです。
Usage/ToS/admin/test/Pleroma FE
  • Public

    • Public
    • Network
    • Groups
    • Featured
    • Popular
    • People

Conversation

Notices

  1. Embed this notice
    Hackernews (hackernews@die-partei.social)'s status on Wednesday, 08-Feb-2023 00:22:34 JST Hackernews Hackernews

    Researchers claim to break 2048-bit encryption [pdf] - https://arxiv.org/abs/2212.12372

    In conversation Wednesday, 08-Feb-2023 00:22:34 JST from die-partei.social permalink

    Attachments

    1. Domain not in remote thumbnail source whitelist: static.arxiv.org
      Factoring integers with sublinear resources on a superconducting quantum processor
      Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance.
    • Embed this notice
      :blobcathug: (jain@blob.cat)'s status on Wednesday, 08-Feb-2023 00:22:40 JST :blobcathug: :blobcathug:
      in reply to
      @hackernews :comfysweat:
      In conversation Wednesday, 08-Feb-2023 00:22:40 JST permalink
    • Embed this notice
      :blobcathug: (jain@blob.cat)'s status on Wednesday, 08-Feb-2023 00:34:11 JST :blobcathug: :blobcathug:
      in reply to
      • :suya:
      @newt @hackernews
      > We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm.
      This does not look like far future stuff but more after very near future...
      https://www.newscientist.com/article/2346074-ibm-unveils-worlds-largest-quantum-computer-at-433-qubits/
      Im pretty sure that there are issues they need to fix but obviously we have to assume sooner rather than later that RSA-2048 is broken
      In conversation Wednesday, 08-Feb-2023 00:34:11 JST permalink

      Attachments

      1. Domain not in remote thumbnail source whitelist: images.newscientist.com
        IBM unveils world's largest quantum computer at 433 qubits
        from @newscientist
        IBM's new quantum computer, Osprey, is more than triple the size of its previous record-breaking Eagle processor
    • Embed this notice
      :suya: (newt@stereophonic.space)'s status on Wednesday, 08-Feb-2023 00:34:12 JST :suya: :suya:
      in reply to
      • :blobcathug:
      @hackernews no, they don't

      >The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer N, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm.

      @Jain
      In conversation Wednesday, 08-Feb-2023 00:34:12 JST permalink
    • Embed this notice
      :blobcathug: (jain@blob.cat)'s status on Wednesday, 08-Feb-2023 00:58:52 JST :blobcathug: :blobcathug:
      in reply to
      • :suya:
      @newt i am aware of that, that is why i am talking about the near future and not the distant future...
      I fear that RSA-2048 will fall in the next few years and after that it wont be that long until RSA-4086 is also broken
      In conversation Wednesday, 08-Feb-2023 00:58:52 JST permalink
    • Embed this notice
      :suya: (newt@stereophonic.space)'s status on Wednesday, 08-Feb-2023 00:58:54 JST :suya: :suya:
      in reply to
      • :blobcathug:
      @Jain not necessarily. I always hate articles like this, because they are sensational in nature and often hide smurky details. Like, the fact that quantum computers are inherently probabilistic in nature, or that the more qbits you entangle with each other, the greater chance of error.
      In conversation Wednesday, 08-Feb-2023 00:58:54 JST permalink
      :blobcathug: likes this.

Feeds

  • Activity Streams
  • RSS 2.0
  • Atom
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

GNU social JP is a social network, courtesy of GNU social JP管理人. It runs on GNU social, version 2.0.2-dev, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All GNU social JP content and data are available under the Creative Commons Attribution 3.0 license.