On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem

DOI10.1007/978-1-4757-0602-4_29zbMath0543.94011DBLPconf/crypto/Adleman82aOpenAlexW1577381550WikidataQ60356618 ScholiaQ60356618MaRDI QIDQ3332924

Leonard M. Adleman

Publication date: 1983

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4757-0602-4_29

zbMATH Keywords

securityknapsack problemcryptologyiterated systemsMerkle-Hellman public-key cryptosystem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

On Lovász' lattice reduction and the nearest lattice point problem ⋮ Knapsack Public Key Cryptosystems and Diophantine Approximation ⋮ Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems

This page was built for publication: On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem