RFC 3713: A Description of the Camellia Encryption Algorithm
In plain English — editorial summary, not part of the RFC
This document describes the Camellia encryption algorithm. Camellia is a block cipher with 128-bit block size and 128-, 192-, and 256-bit keys. The algorithm description is presented together with key scheduling part and data randomizing part. This memo provides information for the Internet community.
Document record
- Document ID
- RFC3713
- Published
- April 2004
- Authors
- M. Matsui; J. Nakajima; S. Moriai
- Status
- INFORMATIONAL
- Stream
- IETF
- Area
- —
- Pages
- 15
- Also known as
- —
Topics
Related documents
Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.
- RFC 6518Keying and Authentication for Routing Protocols (KARP) Design GuidelinesCurrent
February 2012
- RFC 3657Use of the Camellia Encryption Algorithm in Cryptographic Message Syntax (CMS)Current
January 2004
- RFC 3129Requirements for Kerberized Internet Negotiation of KeysCurrent
June 2001
- RFC 4306Internet Key Exchange (IKEv2) ProtocolObsoleted
December 2005
- RFC 2510Internet X.509 Public Key Infrastructure Certificate Management ProtocolsObsoleted
March 1999
- RFC 2409The Internet Key Exchange (IKE)Obsoleted
November 1998
- RFC 2407The Internet IP Security Domain of Interpretation for ISAKMPObsoleted
November 1998
- RFC 6813The Network Endpoint Assessment (NEA) Asokan Attack AnalysisCurrent
December 2012
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?