RFC 2612: The CAST-256 Encryption Algorithm
In plain English — editorial summary, not part of the RFC
This document describes an existing algorithm that can be used to satisfy this requirement. Included are a description of the cipher and the key scheduling algorithm, the s-boxes, and a set of test vectors (Appendix A). This memo provides information for the Internet community.
Document record
- Document ID
- RFC2612
- Published
- June 1999
- Authors
- C. Adams; J. Gilchrist
- Status
- INFORMATIONAL
- Stream
- Legacy
- Area
- —
- Pages
- 19
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 2539Storage of Diffie-Hellman Keys in the Domain Name System (DNS)Updated
March 1999
- RFC 2537RSA/MD5 KEYs and SIGs in the Domain Name System (DNS)Obsoleted
March 1999
- RFC 2528Internet X.509 Public Key Infrastructure Representation of Key Exchange Algorithm (KEA) Keys in Internet X.509 Public Key Infrastructure CertificatesCurrent
March 1999
- RFC 2628Simple Cryptographic Program Interface (Crypto API)Current
June 1999
- RFC 2595Using TLS with IMAP, POP3 and ACAPUpdated
June 1999
- RFC 2554SMTP Service Extension for AuthenticationObsoleted
March 1999
- RFC 2523Photuris: Extended Schemes and AttributesCurrent
March 1999
- RFC 2521ICMP Security Failures MessagesCurrent
March 1999
Also filed under
About this page
The document record above — title, authors, date, status, stream, area, relationships, DOI and errata — is imported verbatim from the public RFC Editor index. The “in plain English” section is editorial: written by The metasystema editorial team, not part of the RFC. Where the two differ, the RFC text governs.
Last checked against the RFC Editor index on . RFCs are never revised after publication; changes are issued as new documents.
Data sources · Editorial policy · Report a correction · What is an RFC?