Post Quantum Cryptography Image

Post Quantum Cryptography

Would you like to know more about technologies for Post Quantum Cryptography ? Find explanations for technology terms on these pages:

Post Quantum Cryptography

What are the most frequently asked questions about PQC?

Here you can find answers for the most frequently asked questions about Post Quantum Cryptography.

Learn More
Post Quantum Cryptography

What is Code-based Cryptography?

Code-based Cryptography comprises of all symmetric or asymmetric cryptosystems whose security depends, in part or entirely, on the difficulty of decoding a linear error-correcting code (for instance, quasi-cyclic code, or Goppa codes).

Learn More
Post Quantum Cryptography

What is Grover’s Algorithm?

Grover's algorithm is a very fast quantum search algorithm. It is used for searching an unsorted database.

Learn More
Post Quantum Cryptography

What is Hash-based Cryptography?

Hash-based cryptography creates digital signature algorithms whose security is mathematically based on the security of a selected cryptographic hash function.

Learn More
Post Quantum Cryptography

What is Key Encapsulation?

Key Encapsulation is a process of generating a random symmetric key and an asymmetric ciphertext against that key.

Learn More
Post Quantum Cryptography

What is Lattice-based Cryptography?

Lattice-based cryptography is acclaimed for its efficiency and scalability, with use cases spanning from the fundamental cryptographic building blocks to immensely complex protocols.

Learn More
Post Quantum Cryptography

What is Post Quantum Cryptography (PQC)?

Post-quantum cryptography refers to cryptographic algorithms that are expected to be secure against a cryptanalytic assault by a quantum computer.

Learn More
Post Quantum Cryptography

What is Quantum Computing?

The study of quantum computing is focused on the development of computer-based technologies based on the principles of quantum theory.

Learn More
Post Quantum Cryptography

What is Shor’s Algorithm?

Shor's algorithm is a quantum computer algorithm that can solve prime factors of an integer in polynomial time.

Learn More
Post Quantum Cryptography

What is the Mosca-theorem?

Dr. Mosca has advocated using an equation to evaluate an organization's readiness for the quantum era. This theory is based on the XYZ risk model.

Learn More

How can we help you?

Talk to one of our specialists and find out how Utimaco can support you today.
You have selected two different types of downloads, so you need to submit different forms which you can select via the two tabs.

Your download request(s):

    By submitting below form you will receive links for your selected downloads.
    Loading...

    Your download request(s):

      For this type of documents, your e-mail address needs to be verified. You will receive the links for your selected downloads via e-mail after submitting below form.
      Loading...

      About Utimaco's Downloads

      Visit our Downloads section and select from resources such as brochures, data sheets, white papers and much more. You can view and save almost all of them directly (by clicking the download button).

      For some documents, your e-mail address needs to be verified. The button contains an e-mail icon.

      Download via e-mail

       

      A click on such a button opens an online form which we kindly ask you to fill and submit. You can collect several downloads of this type and receive the links via e-mail by simply submitting one form for all of them. Your current collection is empty.