ATProto Browser

Record data

{
  "uri": "at://did:plc:fwa55bujvdrwlwlwgqmmxmuf/app.bsky.feed.post/3lofbpzbbo22k",
  "cid": "bafyreiatpaeytzdctg4kptrqrpm63n6i5xya4szwpkvtfppjxvhitdmdmq",
  "value": {
    "text": "Unified MEDS Accelerator (Sanjay Deshpande, Yongseok Lee, Mamuri Nawan, Kashif Nawaz, Ruben Niederhagen, Yunheung Paek, Jakub Szefer) ia.cr/2025/796",
    "$type": "app.bsky.feed.post",
    "embed": {
      "$type": "app.bsky.embed.images",
      "images": [
        {
          "alt": "Abstract. The Matrix Equivalence Digital Signature (MEDS) scheme a code-based candidate in the first round of NIST’s Post-Quantum Cryptography (PQC) standardization process, offers competitively small signature sizes but incurs high computational costs for signing and verification. This work explores how a high-performance FPGA-based hardware implementation can enhance MEDS performance by leveraging the inherent parallelism of its computations, while examining the trade-offs between performance gains and resource costs. This work in particular proposes a unified hardware architecture capable of efficiently performing both signing and verification operations within a single combined design. The architecture jointly supports all security parameters, including the dynamic, run-time handling of different prime fields without the need to re-configure the FPGA. This work also evaluates the resource overhead of supporting different prime fields in a single design, which is relevant not only for MEDS but also for other cryptographic schemes requiring similar flexibility. This work demonstrates that custom hardware for PQC signature schemes can flexibly support different prime fields with limited resource overhead. For example, for NIST security Level I, our implementation achieves signing times of 4.5 ms to 65.2 ms and verification times of 4.2 ms to 64.5 ms utilizing 22k to 72k LUTs and 66 to 273 DSPs depending on design variant and optimization goal.\n",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreia3gvh5rgzmtbciz4adnttebtp32o6mig7vkxcbpkkqw3d3r5f2z4"
            },
            "mimeType": "image/png",
            "size": 108294
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        },
        {
          "alt": "Image showing part 2 of abstract.",
          "image": {
            "$type": "blob",
            "ref": {
              "$link": "bafkreihci4a4x2ezz4kd4oiqtvjp3m6utmczmx73b2jx6kikc5a3wgtbai"
            },
            "mimeType": "image/png",
            "size": 38152
          },
          "aspectRatio": {
            "width": 1200,
            "height": 800
          }
        }
      ]
    },
    "facets": [
      {
        "index": {
          "byteEnd": 148,
          "byteStart": 134
        },
        "features": [
          {
            "uri": "https://ia.cr/2025/796",
            "$type": "app.bsky.richtext.facet#link"
          }
        ]
      }
    ],
    "createdAt": "2025-05-05T02:04:29.218843Z"
  }
}