Coding and Cryptography

DOI10.1007/11779360zbMath1151.94471OpenAlexW2504517155MaRDI QIDQ5899183

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Interpolation of the Double Discrete Logarithm ⋮ Polynomial representations of the Lucas logarithm

This page was built for publication: Coding and Cryptography