Skip to content
GCC AI Research

Search

Results for "irreducible polynomials"

CRC Seminar Series - Prof. Daniel Panario

TII ·

Prof. Daniel Panario gave a seminar on irreducible polynomials over finite fields and their applications in cryptography. The seminar covered how finite fields are used as basic components in many cryptographic applications. It surveyed families of irreducible polynomials and commented on their properties. Why it matters: The talk highlights the mathematical foundations and ongoing research relevant to cryptographic implementations in the region.

CRC Seminar Series - Prof. Francisco Rodriguez-Henriquez

TII ·

CINVESTAV-IPN's Computer Science Department hosted a seminar by Prof. Francisco Rodriguez-Henriquez on isogeny-based key exchange protocols. The talk reviewed Supersingular Isogeny-based Diffie-Hellman (SIDH) and Commutative Supersingular Isogeny-based Diffie-Hellman (CSIDH). Isogeny-based protocols offer short key sizes but have higher latency compared to other post-quantum cryptosystems. Why it matters: This seminar contributes to the exploration of post-quantum cryptography, an important area for ensuring data security against future quantum computing threats.

CRC Seminar Series - Jose Maria Bermudo Mera

TII ·

The National Institute of Standards and Technology (NIST) has been evaluating Post-Quantum Cryptography proposals since 2017. Lattice-based schemes have emerged as efficient candidates for Key Encapsulation Mechanisms (KEM) and Digital Signatures. This talk will cover the core operations within lattice-based schemes and efficient implementation strategies. Why it matters: As quantum computing advances, exploring and standardizing post-quantum cryptography is crucial for maintaining secure communication and data protection in the future.

CRC Seminar Series - Conor McMenamin

TII ·

Conor McMenamin from Universitat Pompeu Fabra presented a seminar on State Machine Replication (SMR) without honest participants. The talk covered the limitations of current SMR protocols and introduced the ByRa model, a framework for player characterization free of honest participants. He then described FAIRSICAL, a sandbox SMR protocol, and discussed how the ideas could be extended to real-world protocols, with a focus on blockchains and cryptocurrencies. Why it matters: This research on SMR protocols and their incentive compatibility could lead to more robust and secure blockchain technologies in the region.

Researchers at CRC Set Decoding Records at INRIA’s McEliece Challenge

TII ·

A cryptanalysis team at the UAE's Cryptography Research Center (CRC) has set new records in computation by decrypting a McEliece ciphertext without the secret key at INRIA’s McEliece decoding challenge, taking first and second place. The record computation took about 31.4 days on a cluster using 256 CPU-cores. The team also achieved top ranks in decoding quasi-cyclic codes and ternary codes, used in post-quantum cryptography. Why it matters: This achievement demonstrates the UAE's growing capabilities in advanced cryptography research and its contributions to the global effort to develop quantum-resistant algorithms.

Optimization of Module Transferability in Single Image Super-Resolution: Universality Assessment and Cycle Residual Blocks

arXiv ·

This paper introduces a method for quantifying the transferability of architectural components in Single Image Super-Resolution (SISR) models, termed "Universality," and proposes a Universality Assessment Equation (UAE). Guided by the UAE, the authors design optimized modules, Cycle Residual Block (CRB) and Depth-Wise Cycle Residual Block (DCRB), and demonstrate their effectiveness across various datasets and low-level tasks. Results show that networks using these modules outperform state-of-the-art methods, achieving improved PSNR or parameter reduction.

CRC Seminar Series - Cristofaro Mune, Niek Timmers

TII ·

Cristofaro Mune and Niek Timmers presented a seminar on bypassing unbreakable crypto using fault injection on Espressif ESP32 chips. The presentation detailed how the hardware-based Encrypted Secure Boot implementation of the ESP32 SoC was bypassed using a single EM glitch, without knowing the decryption key. This attack exploited multiple hardware vulnerabilities, enabling arbitrary code execution and extraction of plain-text data from external flash. Why it matters: The research highlights critical security vulnerabilities in embedded systems and the potential for fault injection attacks to bypass secure boot mechanisms, necessitating stronger hardware-level security measures.

CRC Seminar Series - Associate Professor Anamaria Costache

TII ·

Associate Professor Anamaria Costache from the Norwegian University of Science and Technology (NTNU) will present a seminar on Fully Homomorphic Encryption (FHE). The talk will cover recent advancements in FHE, its mathematical foundations, and implementation results. It will also address remaining challenges in the field. Why it matters: FHE's growing importance is driven by Machine Learning as a Service and the increasing value of secure computation, though the seminar itself has no direct connection to the Middle East.