scientific article; zbMATH DE number 1142302

MaRDI QIDQ4385518zbMATH OpenFDO

Authors Ronald L. Rivest

Publication date 4 May 1998

zbMATH Keywords

complexitycomputational number theorycryptographics systems

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Cited in

(9)

• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• Qubit authentication
• On the existence of quantum signature for quantum messages
• An observation on associative one-way functions in complexity theory
• A new spin on quantum cryptography: avoiding trapdoors and embracing public keys
• NP-completeness: a retrospective
• Digital image encryption based on chaotic map and circulant matrix
• On public-key cryptosystem based on Church-Rosser string-rewriting systems
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography

This page was built for publication:

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