On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (Q2980864): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SIDH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2591576425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Supersingular Isogeny Diffie-Hellman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Hardware Architectures for Supersingular Isogeny Diffie-Hellman Key Exchange on FPGA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Compression of SIDH Public Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of sliding window techniques for exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Fast Exponentiation Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square Root Computation over Even Extension Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Multiplication Without Trial Division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of square roots in finite fields / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:09, 13 July 2024

scientific article
Language Label Description Also known as
English
On Fast Calculation of Addition Chains for Isogeny-Based Cryptography
scientific article

    Statements

    On Fast Calculation of Addition Chains for Isogeny-Based Cryptography (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2017
    0 references
    addition chains
    0 references
    post-quantum cryptography
    0 references
    isogeny-based cryptosystems
    0 references
    finite field
    0 references

    Identifiers