NP completeness of relocation cipher

MaRDI QIDQ3601685zbMATH OpenFDO

Authors Shūichi Suzuki

Publication date 11 February 2009

Full work available at URL http://pphmj.com/abstract/3556.htm

zbMATH Keywords

block cipherknown-plaintext attacknoiseNP completepermutationpseudo random numberquantum computerrelocation tableS-boxstream cipher

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Cryptography (94A60)

Recommendations

• Cryptocomplexity and NP-completeness
• scientific article; zbMATH DE number 219244
• Relativized cryptography
• Public-key cryptographic system based on generalized satisfiability problem
• \texttt{NP}-complete sets for computing discrete logarithms and integer factorization

This page was built for publication: NP completeness of relocation cipher

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