# The information printed when we print the CipherText type? **URL:** \ **Category:** Library Questions\ **Created:** [November 27, 2024, 4:05pm UTC](https://openfhe.discourse.group/t/the-information-printed-when-we-print-the-ciphertext-type/1752 "2024-11-27T16:05:41Z")\ **Posts on this page:** 1\ **Showing post:** 4
**Author:** ![Caesar](https://yyz1.discourse-cdn.com/flex031/user_avatar/openfhe.discourse.group/caesar/32/63_2.png) [@Caesar](https://openfhe.discourse.group/u/Caesar)\ **Post date:** [November 27, 2024, 7:58pm UTC](https://openfhe.discourse.group/t/the-information-printed-when-we-print-the-ciphertext-type/1752/4 "2024-11-27T19:58:08Z")
Sure. I’ll assume you are working with an RLWE-based scheme such as BFV, BGV, or CKKS. An RLWE ciphertext consists of two elements (Element 0 and Element 1) - basically polynomials. Each of these two polynomials is represented by a k \times N matrix - via the Chinese Remainder Theorem (CRT) or DoubleCRT (DCRT). N is known as the ring dimension and any of those polynomials will have a degree of \lt N, whereas k \approx \lceil \log\_2{}Q / average(\log\_2{}modulus\_i) \rceil is the number of levels in the ciphertext. The small moduli modulus\_i are prime numbers that fit in the underlying machine word size, either 64- or 128-bit integers. The label `EVAL` above designates that the polynomials are represented in the evaluation form. The other potential format is `COEFF` which designates coefficient representation. Each of the elements above is called a `DCRTPoly`. For more info on `DCRTPoly`, please refer to this [thread](https://openfhe.discourse.group/t/dcrt-representation-explanation/55). --- _[View the full topic](https://openfhe.discourse.group/t/the-information-printed-when-we-print-the-ciphertext-type/1752)._