{"cited_by_count":298330,"description":"This cluster of papers explores the applications, algorithms, and implementations of elliptic curve cryptography, with a focus on pairing-based cryptosystems, efficient algorithms for finite fields, quantum-resistant cryptosystems, and protection against side-channel attacks. It also covers hardware implementations and the use of elliptic curves in public key encryption.","display_name":"Cryptography and Residue Arithmetic","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T11693","wikipedia":"https://en.wikipedia.org/wiki/Elliptic_curve_cryptography"},"field_id":"17","id":"T11693","keywords":[{"display_name":"elliptic curve cryptography","id":"elliptic-curve-cryptography","score":0.4097,"url":"https://openalex.org/keywords/elliptic-curve-cryptography"},{"display_name":"modular arithmetic","id":"modular-arithmetic","score":0.3075,"url":"https://openalex.org/keywords/modular-arithmetic"},{"display_name":"residue number system","id":"residue-number-system","score":0.7113,"url":"https://openalex.org/keywords/residue-number-system"},{"display_name":"integer factorization","id":"integer-factorization","score":0.2157,"url":"https://openalex.org/keywords/integer-factorization"},{"display_name":"modular exponentiation","id":"modular-exponentiation","score":0.5858,"url":"https://openalex.org/keywords/modular-exponentiation"},{"display_name":"discrete logarithm problem","id":"discrete-logarithm-problem","score":0.2935,"url":"https://openalex.org/keywords/discrete-logarithm-problem"},{"display_name":"modular multiplication","id":"modular-multiplication","score":0.8025,"url":"https://openalex.org/keywords/modular-multiplication"},{"display_name":"finite field arithmetic","id":"finite-field-arithmetic","score":0.6001,"url":"https://openalex.org/keywords/finite-field-arithmetic"},{"display_name":"scalar multiplication","id":"scalar-multiplication","score":0.6236,"url":"https://openalex.org/keywords/scalar-multiplication"},{"display_name":"Montgomery multiplication","id":"montgomery-multiplication","score":0.8891,"url":"https://openalex.org/keywords/montgomery-multiplication"},{"display_name":"pairing-based cryptography","id":"pairing-based-cryptography","score":0.3643,"url":"https://openalex.org/keywords/pairing-based-cryptography"},{"display_name":"elliptic curve scalar multiplication","id":"elliptic-curve-scalar-multiplication","score":0.8564,"url":"https://openalex.org/keywords/elliptic-curve-scalar-multiplication"},{"display_name":"Chinese remainder theorem","id":"chinese-remainder-theorem","score":0.2195,"url":"https://openalex.org/keywords/chinese-remainder-theorem"},{"display_name":"RSA algorithm","id":"rsa-cryptosystem","score":0.3221,"url":"https://openalex.org/keywords/rsa-cryptosystem"},{"display_name":"GF(2^m)","id":"gf-2-m","score":0.8204,"url":"https://openalex.org/keywords/gf-2-m"},{"display_name":"polynomial multiplication","id":"polynomial-multiplication","score":0.3837,"url":"https://openalex.org/keywords/polynomial-multiplication"},{"display_name":"ECDSA","id":"ecdsa","score":0.2822,"url":"https://openalex.org/keywords/ecdsa"},{"display_name":"elliptic curve discrete logarithm problem","id":"elliptic-curve-discrete-logarithm-problem","score":0.4204,"url":"https://openalex.org/keywords/elliptic-curve-discrete-logarithm-problem"},{"display_name":"number theoretic transform","id":"number-theoretic-transform","score":0.4475,"url":"https://openalex.org/keywords/number-theoretic-transform"},{"display_name":"public-key cryptosystems","id":"public-key-cryptosystems","score":0.2123,"url":"https://openalex.org/keywords/public-key-cryptosystems"},{"display_name":"modular inverse","id":"modular-inverse","score":0.5343,"url":"https://openalex.org/keywords/modular-inverse"},{"display_name":"point multiplication","id":"point-multiplication","score":0.8936,"url":"https://openalex.org/keywords/point-multiplication"},{"display_name":"finite field multiplication","id":"finite-field-multiplication","score":0.7798,"url":"https://openalex.org/keywords/finite-field-multiplication"},{"display_name":"supersingular elliptic curves","id":"supersingular-curves","score":0.4308,"url":"https://openalex.org/keywords/supersingular-curves"},{"display_name":"binary field arithmetic","id":"binary-field-arithmetic","score":0.8866,"url":"https://openalex.org/keywords/binary-field-arithmetic"}],"legacy_keywords":["Elliptic Curves","Cryptography","Pairing-Based Cryptosystems","Efficient Algorithms","Quantum-Resistant Cryptosystems","Finite Fields","Modular Multiplication","Side-Channel Attacks","Public Key Encryption","Hardware Implementations"],"openalex_id":"https://openalex.org/T11693","source_created_date":"2024-01-23T15:27:11","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1710","url":"/topics/T11693","works_api_url":"https://api.openalex.org/works?filter=topics.id:T11693","works_count":35532,"label":"Cryptography and Residue Arithmetic","provider":"openalex","revision":"669efa98022e214c","taxonomy_revision":"f050b5d4780b1289","title":"Cryptography and Residue Arithmetic","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36183041118489691","address_version":"morton4x16-v1","coordinates":[3,17,1710,11693],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}