Concept

Inverse modulaire

Publications associées (44)

Generalised Mersenne Numbers Revisited

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

A Class of Generalized RS-Codes with Faster Encoding and Decoding Algorithms

Mohammad Amin Shokrollahi

In this paper we study a particular class of generalized Reed-Solomon codes and introduce encoding and decoding algorithms for such codes that speed up current hardware implementations by a factor p wherein p can be any divisor of the size of the multiplic ...

Ieee2013

Multiplicative structure in equivariant cohomology

Kathryn Hess Bellwald

We introduce the notion of a strongly homotopy-comultiplicative resolution of a module coalgebra over a chain Hopf algebra, which we apply to proving a comultiplicative enrichment of a well-known theorem of Moore concerning the homology of quotient spaces ...

Elsevier2012

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

Modular synthesis of supramolecular ureidopyrimidinone–peptide conjugates using an oxime ligation strategy

Maartje Martina Cornelia Bastings

A convenient method to prepare supramolecular bioconjugates in a facile and scalable manner is by a modular approach, whereby self-assembling units and peptides are coupled using oxime chemistry. We here report syntheses of bioactive ureidopyrimidinone-bas ...

2012

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

Cryptographic Hash Functions in Groups and Provable Properties

Juraj Sarinay

We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...

EPFL2011

Concept of modular flexure-based mechanisms for ultra-high precision robot design

Reymond Clavel, Murielle Richard

This paper introduces a new concept of modular flexure-based mechanisms to design industrial ultra-high precision robots, which aims at significantly reducing both the complexity of their design and their development time. This modular concept can be consi ...

2011

Concept of modular flexure-based mechanisms for ultra-high precision robot design

Reymond Clavel, Murielle Richard

2011

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