computer science

IEEE P1363

IEEE P1363 is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand IEEE P1363 rather than just read about it. In short: IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography. It includes specifications for: Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) Lattice-based public-key cryptography (IEEE Std 1363.1-2008) Password-based public-key cryptography (IEEE Std 1363.2-2008) Identity-based public-key cryptography using pairings (IEEE Std 1…

Key takeaways

IEEE P1363 belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect IEEE P1363 to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of IEEE P1363 from memory before moving on to harder problems.

Reference excerpt

IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography. It includes specifications for:

Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) Lattice-based public-key cryptography (IEEE Std 1363.1-2008) Password-based public-key cryptography (IEEE Std 1363.2-2008) Identity-based public-key cryptography using pairings (IEEE Std 1363.3-2013) The chair of the working group as of October 2008 is William Whyte of NTRU Cryptosystems, Inc., who has served since August 2001. Former chairs were Ari Singer, also of NTRU (1999–2001), and Burt Kaliski of RSA Security (1994–1999). The IEEE Standard Association withdrew all of the 1363 standards except 1363.3-2013 on 7 November 2019.

Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) This specification includes key agreement, signature, and encryption schemes using several mathematical approaches: integer factorization, discrete logarithm, and elliptic curve discrete logarithm.

Key agreement schemes DL/ECKAS-DH1 and DL/ECKAS-DH2 (Discrete Logarithm/Elliptic Curve Key Agreement Scheme, Diffie–Hellman version): This includes both traditional Diffie–Hellman and elliptic curve Diffie–Hellman. DL/ECKAS-MQV (Discrete Logarithm/Elliptic Curve Key Agreement Scheme, Menezes–Qu–Vanstone version)

Signature schemes DL/ECSSA (Discrete Logarithm/Elliptic Curve Signature Scheme with Appendix): Includes four main variants: DSA, ECDSA, Nyberg-Rueppel, and Elliptic Curve Nyberg-Rueppel. IFSSA (Integer Factorization Signature Scheme with Appendix): Includes two variants of RSA, Rabin-Williams, and ESIGN, with several message encoding methods. "RSA1 with EMSA3" is essentially PKCS#1 v1.5 RSA signature; "RSA1 with EMSA4 encoding" is essentially RSA-PSS; "RSA1 with EMSA2 encoding" is essentially ANSI X9.31 RSA signature. DL/ECSSR (Discrete Logarithm/Elliptic Curve Signature Scheme with Recovery) DL/ECSSR-PV (Discrete Logarithm/Elliptic Curve Signature Scheme with Recovery, Pintsov-Vanstone version) IFSSR (Integer Factorization Signature Scheme with Recovery)

Encryption schemes IFES (Integer Factorization Encryption Scheme): Essentially RSA encryption with Optimal Asymmetric Encryption Padding (OAEP). DL/ECIES (Discrete Logarithm/Elliptic Curve Integrated Encryption Scheme): Essentially the "DHAES" variant of ElGamal encryption. IFES-EPOC (Integer Factorization Encryption Scheme, EPOC version)

Lattice-based public key cryptography (IEEE Std 1363.1-2008) NTRU encryption scheme

Password-based public-key cryptography (IEEE Std 1363.2-2008) This document includes a number of password-authenticated key agreement schemes, and a password-authenticated key retrieval scheme.

BPKAS-PAK (Balanced Password-Authenticated Key Agreement Scheme, version PAK) BPKAS-PPK (version PPK) BPKAS-SPEKE (version SPEKE) APKAS-AMP (Augmented Password-Authenticated Key Agreement Scheme, version AMP) APKAS-BSPEKE2 (version BSPEKE2) APKAS-PAKZ (version PAKZ) APKAS-SRP3 and SRP6 (version Secure Remote Password (SRP) 3 and 6) APKAS-SRP5 (version Secure Remote Password (SRP) 5) APKAS-WSPEKE (version WSPEKE) PKRS-1 (Password Authenticated Key Retrieval Scheme, version 1)

Identity-based public key cryptography based on pairings (IEEE Std 1363.3-2013) This standard was published on 15 November 2013. It includes techniques for identity-based encryption, signatures, signcryption, key agreement, and proxy re-encryption, all based on bilinear pairings.

References

External links IEEE P1363 home page

Worked examples

Example 1 — a first encounter with IEEE P1363

Start with the simplest possible case. Write down what IEEE P1363 claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to IEEE P1363 before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about IEEE P1363 ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of IEEE P1363

In research: IEEE P1363 appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses IEEE P1363 in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: IEEE P1363 is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cryptography standards, IEEE standards, Post-quantum cryptography, so understanding it makes those chapters shorter.
In everyday life: Look for IEEE P1363 outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “IEEE P1363” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study IEEE P1363 in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what IEEE P1363 means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain IEEE P1363 out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is IEEE P1363 in simple terms?

IEEE P1363 is an Institute of Electrical and Electronics Engineers (IEEE) standardization project for public-key cryptography. It includes specifications for: Traditional public-key cryptography (IEEE Std 1363-2000 and 1363a-2004) Lattice-based public-key cryptography (IEEE Std 1363.1-2008) Passwor…

Why does IEEE P1363 matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study IEEE P1363?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on IEEE P1363.