Polynomial interpolation of the Naor-Reingold pseudo-random function
From MaRDI portal
Publication:2363385
DOI10.1007/s00200-016-0309-4zbMath1369.11098OpenAlexW2549991440MaRDI QIDQ2363385
Thierry Mefenza, Damien Vergnaud
Publication date: 19 July 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-016-0309-4
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of the Naor-Reingold pseudo-random function
- On the linear complexity of the Naor-Reingold sequence with elliptic curves
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- On the Naor-Reingold pseudo-random function from elliptic curves
- Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
- On the linear complexity of the Naor-Reingold sequence
- Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
- Polynomial representations of the Diffie-Hellman mapping
- A note on the interpolation of the Diffie-Hellman mapping
- Number-theoretic constructions of efficient pseudo-random functions
- On the Multidimensional Distribution of the Naor–Reingold Pseudo-Random Function
- Interpolation of the Double Discrete Logarithm
- On the interpolation of bivariate polynomials related to the Diffie-Hellman mapping
- On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves.
