Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
1	Computing discrete logarithms in fields of small characteristic Francisco Rodr´ıguez-Henr´ıquez CINVESTAV-IPN Joint work with: Add to Reading List Source URL: delta.cs.cinvestav.mx Language: English - Date: 2014-04-09 13:26:56 Abstract algebra Algebra Cryptography Finite fields Group theory Logarithms Computational hardness assumptions Binary operations Discrete logarithm Elliptic curve cryptography Prime number Elliptic curve
2	Revisiting discrete logarithms in medium/small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 Add to Reading List Source URL: www.cosic.esat.kuleuven.be Language: English - Date: 2013-09-21 07:48:03 Abstract algebra Algebra Group theory Mathematics Logarithms Computational hardness assumptions Finite fields Modular arithmetic Index calculus algorithm Discrete logarithm Baby-step giant-step Elliptic curve
3	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
4	Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint ∗ Alexander May, Maike Ritzenhofen Horst Görtz Institute for IT-security Faculty of Mathematics Ruhr-University of Bochum, 44780 Bochum, Ger Add to Reading List Source URL: www.cits.rub.de Language: English - Date: 2015-08-28 10:30:32 Cryptography Integer factorization algorithms Computational hardness assumptions E-commerce RSA Quadratic sieve Lattice Integer factorization
5	Security of the J-PAKE Password-Authenticated Key Exchange Protocol Michel Abdalla Fabrice Benhamouda Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2015-03-20 08:39:27 Cryptography Finite fields Computational hardness assumptions Password-authenticated key agreement Password Authenticated Key Exchange by Juggling SPEKE DiffieHellman problem Zero-knowledge proof XTR Digital signature Proof of knowledge
6	Motivation - Exotic Security Assumptions in Cryptography Main Algorithm and Results Oracle-assisted Static DHP for binary curves On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields Add to Reading List Source URL: 2010.eccworkshop.org Language: English - Date: 2010-10-25 19:46:00 Cryptography Abstract algebra Algebra Computational hardness assumptions Finite fields DiffieHellman problem Group theory Elliptic curve cryptography Provable security Whitfield Diffie DiffieHellman key exchange Elliptic curve
7	E-th roots and static Diffie-Hellman using index calculus Antoine Joux1 Joint work with Reynald Lercier2 , David Naccache3 , Emmanuel Thome´ 4 Elliptic Curve Cryptography 2008 Add to Reading List Source URL: www.hyperelliptic.org Language: English - Date: 2008-10-04 13:47:14 Cryptography Abstract algebra Algebra Finite fields Public-key cryptography Computational hardness assumptions Group theory DiffieHellman key exchange Index calculus algorithm RSA Discrete logarithm Elliptic curve cryptography
8	An Attack Against Fixed Value Discrete Logarithm Representations Gergely Alp´ ar1,2⋆ , Jaap-Henk Hoepman1,2 , and Wouter Lueks1,2⋆⋆ 1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-02-28 05:16:42 Binary operations Finite fields Computational hardness assumptions Group theory Trapdoor function Public-key cryptography One-way function Exponentiation Discrete logarithm Cryptography Abstract algebra Mathematics
9	Discrete logarithms: Recent progress in small characteristic Antoine Joux CryptoExperts Chaire de Cryptologie de la Fondation de l’UPMC — LIP6 Add to Reading List Source URL: www-fourier.ujf-grenoble.fr Language: English - Date: 2014-03-31 03:20:36 Logarithms Computational hardness assumptions Modular arithmetic Finite fields Discrete logarithm Index calculus algorithm Elliptic curve Discrete logarithm records Abstract algebra Mathematics Group theory
10	Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France Add to Reading List Source URL: book.huihoo.com Language: English - Date: 2006-07-27 09:21:33 Cryptographic protocols Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange XTR Discrete logarithm ElGamal encryption Subliminal channels RSA Cryptography Computational hardness assumptions Finite fields

UPDATE