{
  "meta": {
    "api_type": "NWO Projects API",
    "version": "1.0.2",
    "licence": {
      "name": "CC0 1.0 Universal",
      "url": "https://creativecommons.org/publicdomain/zero/1.0",
      "description": "To the extent possible under law, all copyright and related or neighbouring rights have been waived worldwide to the data made available through this API."
    },
    "documentation": "https://doi.org/10.5281/zenodo.14918287",
    "release_date": "2025-08-20T00:00:00",
    "funder": "https://doi.org/10.13039/501100003246",
    "ror_id": "https://ror.org/04jsz6e67",
    "date": "2026-11-05T00:00:00",
    "count": 1,
    "per_page": 100,
    "pages": 1,
    "page": 1
  },
  "projects": [
    {
      "project_id": "NGF.1623.23.020",
      "title": "Strong Practical Security of Future Post-Quantum Digital Signature Standards (PQstrong)",
      "funding_scheme_id": 4830,
      "funding_scheme": "NGF - Quantum Delta NL Quantum Technologie 2023 2023",
      "department": "Exacte en Natuurwetenschappen",
      "sub_department": "Exacte en Natuurwetenschappen",
      "start_date": "2024-06-01T00:00:00",
      "reporting_year": 2023,
      "summary_nl": "Post-kwantumhandtekeningen zijn digitale handtekeningen die kunnen worden uitgevoerd op klassieke computers, maar met de belofte om zelfs voor tegenstanders met een kwantumcomputer veilig te zijn. De kwantumcomputer die dicht bij de realiteit staat, heeft de wereld aangespoord om standaardisatieprocessen te starten voor het standaardiseren van post- kwantumhandtekeningen. Dit project heeft tot doel dit proces te ondersteunen door nieuwe cryptanalytische methoden en technieken voor het onderzoeken van de voorgestelde ontwerpen en het verbeteren van het vertrouwen in de veiligheid van de gekozen standaarden. Het zal de veiligheid van de algoritmen en hun fysieke implementaties evalueren en passende tegenmaatregelen voorstellen.",
      "summary_en": "Post-quantum signatures are digital signatures that can be run on classical computers but with the promise of being secure even for adversaries with a quantum computer. The quantum computer being close to reality has urged the world to start standardization processes for stadardizing post-quantum signatures. This project aims at aiding this process by providing new cryptanalytic methods and techniques for scrutinizing the proposed designs and improving the confidence in the security of the chosen standards. It will help evaluate both the security of the algorithms and the security of their physical implementations and propose appropriate countermeasures.",
      "award_amount": 502348,
      "grant_id": "https://doi.org/10.61686/ZZCES81682",
      "summary_updates": [
        {
          "submission_date": "2026-07-31T13:35:19",
          "update_en": "In the first half of the project, we have obtained results that on one hand improve our understanding of the power of one of the most relevant attacks against post-quantum cryptosystems and on the other hand help design more efficient and compact post-quantum secure cryptographic schemes. \n\nThe focus is on reduced resources needed for our algorithms – in one case for smaller time and memory complexity of a cryptanalytical tool, and in the other case for shorter digital signatures. With post-quantum standardization processes ongoing, both aspects are important for making sound design choices for the schemes still in the competition.",
          "update_nl": "In de eerste helft van het project hebben we\n\nresultaten behaald die enerzijds ons inzicht vergroten in de kracht van een van de\n\nbelangrijkste aanvallen op post-kwantumcryptosystemen en anderzijds bijdragen aan\n\nhet ontwerpen van efficiëntere en compactere post-kwantumveilige cryptografische schema’s. \n\n\n\nDe nadruk ligt op het verminderen van de benodigde\n\nmiddelen voor onze algoritmen – in het ene geval de tijd- en geheugencomplexiteit van een\n\ncryptoanalytisch hulpmiddel, en in het andere geval het verkrijgen van kortere digitale\n\nhandtekeningen. Aangezien de standaardisatieprocessen voor post-kwantumcryptografie nog gaande zijn, zijn beide aspecten belangrijk voor het maken van weloverwogen ontwerpkeuzes voor de resterende schema’s."
        }
      ],
      "project_members": [
        {
          "role": "Main Applicant",
          "member_id": 503081,
          "last_name": "Samardjiska",
          "degree_pre_nominal": "dr.",
          "initials": "S.",
          "first_name": "Simona",
          "organisation": "Radboud Universiteit Nijmegen||Faculteit der Natuurwetenschappen, Wiskunde en Informatica||Institute for Computing and Information Sciences (ICIS)",
          "organisation_id": 79553,
          "ror": "https://ror.org/016xsfp80",
          "active": true
        },
        {
          "role": "Project leader",
          "member_id": 503081,
          "last_name": "Samardjiska",
          "degree_pre_nominal": "dr.",
          "initials": "S.",
          "first_name": "Simona",
          "organisation": "Radboud Universiteit Nijmegen||Faculteit der Natuurwetenschappen, Wiskunde en Informatica||Institute for Computing and Information Sciences (ICIS)",
          "organisation_id": 79553,
          "ror": "https://ror.org/016xsfp80",
          "active": true
        }
      ],
      "products": [
        {
          "title": "Quantum combinatorial games",
          "year": 2026,
          "type": "Overige Output",
          "url_open_access": "https://arxiv.org/pdf/2607.06550",
          "authors": [
            {
              "last_name": "Westerbaan",
              "initials": "B",
              "first_name": "Bram",
              "role": "Maker"
            },
            {
              "last_name": "Scholten",
              "initials": "D",
              "first_name": "Dieks",
              "role": "Maker"
            },
            {
              "last_name": "Samardjiska",
              "initials": "S",
              "first_name": "Simona",
              "role": "Maker"
            }
          ]
        },
        {
          "title": "miniMEDS - Short GMW Signatures from Isometry Hints",
          "year": 2026,
          "type": "Overige Output",
          "url_open_access": "https://eprint.iacr.org/2026/1323.pdf",
          "authors": [
            {
              "last_name": "Blom",
              "initials": "D",
              "first_name": "Dinand",
              "role": "Maker"
            },
            {
              "last_name": "Lamorgese",
              "initials": "G",
              "first_name": "Giuseppe",
              "role": "Maker"
            },
            {
              "last_name": "Ran",
              "initials": "L",
              "first_name": "Lars",
              "role": "Maker"
            },
            {
              "last_name": "Niederhagen",
              "initials": "R",
              "first_name": "Ruben",
              "role": "Maker"
            },
            {
              "last_name": "Samardjiska",
              "initials": "S",
              "first_name": "Simona",
              "role": "Maker"
            }
          ]
        },
        {
          "title": "Smoothing the degree of regularity for polynomial systems",
          "year": 2026,
          "type": "Overige Output",
          "url_open_access": "https://eprint.iacr.org/2026/408.pdf",
          "authors": [
            {
              "last_name": "Ran",
              "initials": "L",
              "first_name": "Lars",
              "role": "Maker"
            },
            {
              "last_name": "Seitner",
              "initials": "M",
              "first_name": "Melvin",
              "role": "Maker"
            },
            {
              "last_name": "Jaques",
              "initials": "S",
              "first_name": "Samuel",
              "role": "Maker"
            },
            {
              "last_name": "Samardjiska",
              "initials": "S",
              "first_name": "Simona",
              "role": "Maker"
            }
          ]
        },
        {
          "title": "Thanks to this research, your internet communication will be safer in the future",
          "year": 2026,
          "type": "Overige Output",
          "url_open_access": "https://www.ru.nl/en/research/research-news/thanks-to-this-research-your-internet-communication-will-be-safer-in-the-future",
          "authors": [
            {
              "last_name": "Samardjiska",
              "initials": "S",
              "first_name": "Simona",
              "role": "Maker"
            }
          ]
        }
      ]
    }
  ]
}
