We introduce Integer-Dependent Receiver Encoding (IDRE), a cryptographic protocol designed for distributed cognitive architectures with stable attractor dynamics. Unlike traditional public-key infrastructure (PKI), IDRE does not rely on stored static keys or negotiated secrets. Instead, security emerges from the non-exportable geometry of internal vector fields (attractors). In this protocol, the sender transmits a sequence of semantic-free integers that act as pointers to a shared, dynamic internal state. We formally define the decoding function, demonstrating that without the precise topological configuration of the receiver's attractor field, the intercepted integers are mathematically orthogonal to the plaintext. This paper presents the theoretical framework and Test Vector 0002, validating the protocol under high-entropy permutation modes. Results show 100% permutation drift and zero signal correlation in adversarial scenarios. This establishes IDRE as a viable candidate for "Field-Bound Security" in bandwidth-constrained, high-latency environments.