On elliptic curve $L$-functions integrated encryption scheme
From MaRDI portal
Publication:6196946
DOI10.4064/bc126-4MaRDI QIDQ6196946
Publication date: 15 March 2024
Published in: Banach Center Publications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves over global fields (11G05) Elliptic curves (14H52) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring integers with elliptic curves
- The existence of infinitely many supersingular primes for every elliptic curve over \(\mathbb Q\).
- Quelques applications du théorème de densité de Chebotarev
- Frobenius distributions in \(\mathrm{GL}_2\)-extensions. Distribution of Frobenius automorphisms in \(\mathrm{GL}_2\)-extensions of the rational numbers
- Zeta functions, one-way functions, and pseudorandom number generators.
- A search for good pseudo-random number generators: survey and empirical studies
- Hashing with Elliptic Curve L-Functions
- A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
- Lattice-based Cryptography
- Communication Theory of Secrecy Systems*
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Inferring sequences produced by pseudo-random number generators
- How to predict congruential generators
This page was built for publication: On elliptic curve $L$-functions integrated encryption scheme