Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.
A New Type of Cipher
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We will define a new type of cipher that doesn't use neither an easy to calcualate and hard to invert matematical function like RSA nor a classical mono or polyalphabetic cipher.
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem
Syntactic separation of Skolem functions in local systems implies computational indistinguishability with Omega(n) or Omega(2^n) derivation lower bounds, presented as an abstract obstruction governing Natural Proofs, Type Omitting Theorem, and AC^0 barriers.