Coding and Cryptography

DOI10.1007/11779360MaRDI QIDQ5899183zbMATH OpenOpenAlexFDO

Authors Clemens Adelmann, Arne Winterhof

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11779360

zbMATH Keywords

weightpolynomialsdegreeadditive complexityCarmichael's functionEuler's totient functiondivisor sum functionfactoring problemRSA-problem

Mathematics Subject Classification ID

Cryptography (94A60) Approximation algorithms (68W25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• scientific article; zbMATH DE number 562223
• A public key cryptosystem as hard as factorisation
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
• Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions

Cited in

(5)

• Interpolation and Combinatorial Functions
• The polynomial composition problem in \((\mathbb Z/n\mathbb Z)[X]\)
• Polynomial representations of the Lucas logarithm
• Interpolation of the Double Discrete Logarithm
• A bivariate polynomial-based cryptographic hard problem and its applications

This page was built for publication: Coding and Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899183)