Results 101 to 110 of about 4,641 (196)
Slope classicality in higher Coleman theory via highest weight vectors in completed cohomology. [PDF]
Howe S.
europepmc +1 more source
Efficiency of SIDH-based signatures (yes, SIDH)
In this note, we assess the efficiency of a supersingular isogeny Diffie-Hellman (SIDH)-based digital signature built on a weaker variant of a recent identification protocol proposed by Basso et al.
Ghantous Wissam +2 more
doaj +1 more source
Towards Green Computing Oriented Security: A Lightweight Postquantum Signature for IoE. [PDF]
Rani R +7 more
europepmc +1 more source
Explicit isogenies of elliptic curves [PDF]
Let E be an elliptic curve defined over a field K. The main topic of this thesis is to present a method for the explicit computation of all separable K- rational l-isogenies of E and isogenous curves for small primes l.
Tsukazaki, Kiminori
core
Evaluating Large Degree Isogenies between Elliptic Curves [PDF]
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same endomorphism ring,
Soukharev, Vladimir
core
Verifiable Delay Function and Its Blockchain-Related Application: A Survey. [PDF]
Wu Q, Xi L, Wang S, Ji S, Wang S, Ren Y.
europepmc +1 more source
Sarcopenia: Molecular regulatory network for loss of muscle mass and function. [PDF]
Wu J +7 more
europepmc +1 more source
The dihedral hidden subgroup problem
The hidden subgroup problem (HSP) is a cornerstone problem in quantum computing, which captures many problems of interest and provides a standard framework algorithm for their study based on Fourier sampling, one class of techniques known to provide ...
Chen Imin, Sun David
doaj +1 more source
Isogenies of Elliptic Curves: A Computational Approach [PDF]
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the reducibility of
Daniel Shumow
core +1 more source

