blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts

Preview meta tags from the blog.icme.io website.

Linked Hostnames

6

Thumbnail

Search Engine Appearance

Google

https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts

Folding schemes in the lattice setting: pay-per-bit and NTTs

Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[



Bing

Folding schemes in the lattice setting: pay-per-bit and NTTs

https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts

Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[



DuckDuckGo

https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts

Folding schemes in the lattice setting: pay-per-bit and NTTs

Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[

  • General Meta Tags

    7
    • title
      Folding schemes in the lattice setting: pay-per-bit and NTTs
    • charset
      utf-8
    • viewport
      width=device-width, initial-scale=1
    • referrer
      no-referrer-when-downgrade
    • article:published_time
      2025-06-25T14:14:35.000Z

  • Open Graph Meta Tags

    8
    • og:site_name
      ICME
    • og:type
      article
    • og:title
      Folding schemes in the lattice setting: pay-per-bit and NTTs
    • og:description
      Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[
    • og:url
      https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts/

  • Twitter Meta Tags

    8
    • twitter:card
      summary_large_image
    • twitter:title
      Folding schemes in the lattice setting: pay-per-bit and NTTs
    • twitter:description
      Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[
    • twitter:url
      https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts/
    • twitter:image
      https://blog.icme.io/content/images/2023/02/DALL-E-2023-02-15-13.05.41---create-a-light-blue-geometric-pattern-for-a-publication-cover.-.png

  • Link Tags

    6
    • alternate
      https://blog.icme.io/rss/
    • canonical
      https://blog.icme.io/folding-schemes-in-the-lattice-setting-pay-per-bit-and-ntts/
    • icon
      https://blog.icme.io/content/images/size/w256h256/2023/02/icme_small.jpeg
    • stylesheet
      https://blog.icme.io/assets/built/screen.css?v=5724791d70
    • stylesheet
      /public/cards.min.css?v=5724791d70

Links

14