Algorithmic Number Theory

DOI10.1007/11792086zbMath1143.11365arXivmath/0606771OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899277

Ilya Mironov, Anton Mityagin, Kobbi Nissim

Publication date: 2 May 2007

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

Full work available at URL: https://arxiv.org/abs/math/0606771

zbMATH Keywords

lower bounds on complexityconstrained DLPgeneralized Menelaus' theorem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (1)

Analysis of low Hamming weight products

This page was built for publication: Algorithmic Number Theory