Publications associées à Lattices and factorization of polynomials

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.

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2016

Lattices and factorization of polynomials

Graph Chatbot

Chattez avec Graph Search

Considerations for Rank-based Cryptosystems

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

On the discrete logarithm problem in finite fields of fixed characteristic

Torsion homology of arithmetic lattices and K-2 of imaginary fields

Algebraic algorithms for network information flow

On the size of Satake parameters for unitary cuspidal automorphic representations for GL(4)

Properties of Network Polynomials

Properties of Network Polynomials

A Probabilistic Approach of Sum Rules for Heat Polynomials

On the discrete logarithm problem in finite fields of fixed characteristic

Considerations for Rank-based Cryptosystems

Properties of Network Polynomials

Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets

Properties of Network Polynomials

Algebraic algorithms for network information flow

On the size of Satake parameters for unitary cuspidal automorphic representations for GL(4)

ON THE DISCRETE LOGARITHM PROBLEM IN FINITE FIELDS OF FIXED CHARACTERISTIC

Torsion homology of arithmetic lattices and K-2 of imaginary fields

A Probabilistic Approach of Sum Rules for Heat Polynomials