pith. sign in

arxiv: 1202.2004 · v3 · pith:NEFJFNKPnew · submitted 2012-02-09 · 💻 cs.CR

A New Type of Cipher

Fabio F. G. Buono This is my paper
classification 💻 cs.CR
keywords ciphertypecalcualateclassicaldefinedoesneasyfunction
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Syntactic Systems Cannot See Semantic Invariants

    cs.LO 2026-06 unverdicted novelty 6.0

    Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.

  2. Syntactic Separation Implies Computational Indistinguishability: An Abstract Obstruction Theorem

    cs.LO 2026-06 unverdicted novelty 5.0

    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, ...