ATProto Browser

ATProto Browser

Experimental browser for the Atmosphere

Post

Efficient Noncommutative KEMs from Twisted Dihedral Group Ring (Ali Raya, Vikas Kumar, Sugata Gangopadhyay, Aditi Kar Gangopadhyay) ia.cr/2025/795

May 5, 2025, 2:04 AM

Record data

{
  "uri": "at://did:plc:fwa55bujvdrwlwlwgqmmxmuf/app.bsky.feed.post/3lofbpsqbqq2f",
  "cid": "bafyreihjtuzx542ymcaf77lqtxjzxajsvqcxgvnncl37pz7hv5p2opgavy",
  "value": {
    "text": "Efficient Noncommutative KEMs from Twisted Dihedral Group Ring (Ali Raya, Vikas Kumar, Sugata Gangopadhyay, Aditi Kar Gangopadhyay) ia.cr/2025/795",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "Abstract. NTRU schemes have been extensively studied as post-quantum proposals within the category of lattice-based constructions. Numerous designs have been introduced with security assumptions based on the NTRU hard problem; some focused on security, and others were motivated by faster computations. Recently, some proposals for noncommutative NTRU have appeared in the literature, claiming more resistance to some algebraic attacks. While these proposals provide practical cryptosystems, they fail to perform similarly to the original NTRU over the ring of integers. This work introduces the first construction of noncommutative NTRU that matches the speed of NTRU over the ring of integers. Additionally, we present another construction over the ring of Eisenstein integers, demonstrating that performance can be further enhanced. We comprehensively implement the Key Encapsulation Mechanisms (KEMs) based on our constructions and compare their efficiency and compactness to both commutative and noncommutative NTRU variants in the literature. Our findings indicate that the new designs provide competitive memory and time requirements while utilizing noncommutative algebra. For example, our noncommutative KEM based on the twisted dihedral group ring over the ring of integers achieves encapsulation and decapsulation speeds comparable to NTRU-HPS, with a key generation speed that is 2.5 times faster. Additionally, our construction based on the ring of Eisenstein integers is at least 1.6 times faster for key generation and 1.3 times faster for both encapsulation and decapsulation compared to NTRU-HPS.\n",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreih6inna76ca6neapjzlas3sik7ul36wypbetukw6ihmmgd5j6s6gu"
            },
            "mimeType": "image/png",
            "size": 101336
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        },
        {
          "alt": "Image showing part 2 of abstract.",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreiefesp4vgsiscc6osm7dd2sp6cuzbbxwl6dylahow4q55xqhv4asm"
            },
            "mimeType": "image/png",
            "size": 53657
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        }
      ]
    },
    "facets": [
      {
        "index": {
          "byteEnd": 146,
          "byteStart": 132
        },
        "features": [
          {
            "uri": "https://ia.cr/2025/795",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2025-05-05T02:04:22.563804Z"
  }
}