Concept

Exponentiation modulaire

Publications associées (30)

SIMToolbox: a MATLAB toolbox for structured illumination fluorescence microscopy

SIMToolbox is an open-source, modular set of functions for MATLAB equipped with a user-friendly graphical interface and designed for processing two-dimensional and three-dimensional data acquired by structured illumination microscopy (SIM). Both optical se ...

Oxford University Press2016

Colloidal Nanocrystal Frameworks

Raffaella Buonsanti

A review. Colloidal nanocrystal frameworks (CNFs) are a modular class of mesostructured porous materials, which are assembled from pre-formed nanocrystal building units using suitably designed block copolymer architecture-directing agents. The functional a ...

2015

A Fast Modular Method for True Variation-Aware Separatrix Tracing in Nanoscaled SRAMs

Adam Shmuel Teman

As memory density continues to grow in modern systems, accurate analysis of SRAM stability is increasingly important to ensure high yields. Traditional static noise margin metrics fail to capture the dynamic characteristics of SRAM behavior, leading to exp ...

Institute of Electrical and Electronics Engineers2015

CAST: An automated segmentation and tracking tool for the analysis of transcriptional kinetics from single-cell time-lapse recordings

Felix Naef, Benjamin Zoller, Damien Lionel Nicolas, Simon Blanchoud, Onur Tidin

Fluorescence and bioluminescence time-lapse imaging allows to investigate a vast range of cellular processes at single-cell or even subcellular resolution. In particular, time-lapse imaging can provide uniquely detailed information on the fine kinetics of ...

Academic Press Inc Elsevier Science2015

On the Analysis of Public-Key Cryptologic Algorithms

Andrea Miele

The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...

EPFL2015

Generalised Mersenne Numbers Revisited

Robert Granger

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...

2013

Terahertz passive components for Dynamic Nuclear Polarization Nuclear Magnetic Resonance applications

Emile Jacques de Rijk

Terahertz radiation, THz = 1012 Hz, refers to electromagnetic signals with frequencies in the range of 0.3 to 3 THz, and wavelengths between 1 and 0.1 mm. This part of the electromagnetic spectrum is located in between millimeter waves at lower frequencies ...

EPFL2013

Primeless Modular Cryptography (Extended Abstract)

Serge Vaudenay, Sonia Mihaela Bogos

Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...

2012

On the Cryptanalysis of Public-Key Cryptography

Joppe Willem Bos

Nowadays, the most popular public-key cryptosystems are based on either the integer factorization or the discrete logarithm problem. The feasibility of solving these mathematical problems in practice is studied and techniques are presented to speed-up the ...

EPFL2012

Efficient Fail-Stop Signatures from the Factoring Assumption

Khaled Ouafi, Atefeh Mashatan

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...

Springer2011

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search