Výsledky vyhledávání - "ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems"

1

Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves

Autoři: Smith, Benjamin Nigel Smart Algorithmic number theory for cryptology (TANC) a další

Přispěvatelé: Smith, Benjamin Nigel Smart Algorithmic number theory for cryptology (TANC) a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783540789666

Témata: Mathematics - Number Theory, 11Y99, 14H40, 14H45, 14G50 (Secondary), 11G20 (Primary), 0102 computer and information sciences, 01 natural sciences, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], FOS: Mathematics, Number Theory (math.NT), ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.0: Code breaking, 0101 mathematics, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [MATH.MATH-NT] Mathematics [math]/Number Theory [math.NT], [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F978-3-540-78967-3_10.pdf
http://eprint.iacr.org/2007/428.pdf
http://arxiv.org/abs/0806.2995
https://inria.hal.science/inria-00537860v1
https://doi.org/10.1007/978-3-540-78967-3_10
https://inria.hal.science/inria-00537851v1
https://doi.org/10.1007/s00145-009-9038-1
https://link.springer.com/content/pdf/10.1007%2Fs00145-009-9038-1.pdf
https://link.springer.com/article/10.1007/s00145-009-9038-1
https://dblp.uni-trier.de/db/journals/joc/joc22.html#Smith09
https://hal.inria.fr/inria-00537851
https://hal.inria.fr/inria-00537860
https://link.springer.com/10.1007/978-3-540-78967-3_10
https://www.iacr.org/archive/eurocrypt2008/49650162/49650162.pdf
https://link.springer.com/chapter/10.1007%2F978-3-540-78967-3_10
https://rd.springer.com/chapter/10.1007/978-3-540-78967-3_10
https://doi.org/10.1007/978-3-540-78967-3_10

View record at OpenAIRE

Full Text Finder

Nájsť tento článok vo Web of Science

2

RNS Modular Multiplication through Reduced Base Extensions

Autoři: Bigou, Karim Tisserand, Arnaud Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (CAIRN) a další

Přispěvatelé: Bigou, Karim Tisserand, Arnaud Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (CAIRN) a další

Zdroj: ASAP - 25th IEEE International Conference on Application-specific Systems, Architectures and Processors ; https://inria.hal.science/hal-01010961 ; ASAP - 25th IEEE International Conference on Application-specific Systems, Architectures and Processors, Jun 2014, Zurich, Switzerland. pp.57-62, ⟨10.1109/ASAP.2014.6868631⟩

Témata: Residue Number System, Montgomery Multiplication, Finite Field Arithmetic, Asymmetric Cryptography, Elliptic Curve Cryptography (ECC), Discrete Logarithm (DL), ACM: B.: Hardware/B.2: ARITHMETIC AND LOGIC STRUCTURES/B.2.4: High-Speed Arithmetic, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR]

Geografické téma: Zurich, Switzerland

Dostupnost: https://inria.hal.science/hal-01010961
https://inria.hal.science/hal-01010961v1/document
https://inria.hal.science/hal-01010961v1/file/article_asap2014.pdf
https://doi.org/10.1109/ASAP.2014.6868631

View record from BASE

Nájsť tento článok vo Web of Science

3

On-the-Fly Multi-Base Recoding for ECC Scalar Multiplication without Pre-Computations

Autoři: Chabrier, Thomas Tisserand, Arnaud Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (CAIRN) a další

Přispěvatelé: Chabrier, Thomas Tisserand, Arnaud Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources (CAIRN) a další

Zdroj: ARITH - 21st IEEE International Symposium on Computer Arithmetic ; https://inria.hal.science/hal-00772613 ; ARITH - 21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.219-228, ⟨10.1109/ARITH.2013.17⟩

Témata: elliptic curve cryptography, scalar multiplication, DBNS, MBNS, divisibility test, exact division by constant, ACM: B.: Hardware/B.2: ARITHMETIC AND LOGIC STRUCTURES, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-AO]Computer Science [cs]/Computer Arithmetic, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics

Geografické téma: Austin, TX, United States

Dostupnost: https://inria.hal.science/hal-00772613
https://inria.hal.science/hal-00772613v1/document
https://inria.hal.science/hal-00772613v1/file/PID2635353.pdf
https://doi.org/10.1109/ARITH.2013.17

View record from BASE

Nájsť tento článok vo Web of Science

4

Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic

Autoři: Ducas, Léo Nguyen, Phong Q. Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE) a další

Přispěvatelé: Ducas, Léo Nguyen, Phong Q. Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE) a další

Zdroj: ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security ; https://inria.hal.science/hal-00864360 ; ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, IACR, Dec 2012, Beijing, China. pp.415-432, ⟨10.1007/978-3-642-34961-4_26⟩ ; http://link.springer.com/chapter/10.1007%2F978-3-642-34961-4_26

Témata: Signatures, NTRU, NTRUsign, Gaussian sampling, Lattices, Floating-point arithmetic, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Beijing, China

Dostupnost: https://inria.hal.science/hal-00864360
https://inria.hal.science/hal-00864360v1/document
https://inria.hal.science/hal-00864360v1/file/DucasNguyen_Sampling.pdf
https://doi.org/10.1007/978-3-642-34961-4_26

View record from BASE

Nájsť tento článok vo Web of Science

5

Round-Optimal Privacy-Preserving Protocols with Smooth Projective Hash Functions

Autoři: Blazy, Olivier Pointcheval, David Vergnaud, Damien a další

Přispěvatelé: Blazy, Olivier Pointcheval, David Vergnaud, Damien a další

Zdroj: TCC 2012 - Ninth IACR Theory of Cryptography Conference ; https://hal.inria.fr/hal-00672939 ; TCC 2012 - Ninth IACR Theory of Cryptography Conference, Mar 2012, Taormina, Italy. pp.94-112, ⟨10.1007/978-3-642-28914-9_6⟩

Témata: oblivious signature-based envelopes, blind signatures, smooth projective hash functions, bilinear groups, standard model with common-reference string, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Taormina, Italy

Relation: info:eu-repo/grantAgreement/EC/FP7/216676/EU/European Network of Excellence in Cryptology - Phase II/ECRYPT II; hal-00672939; https://hal.inria.fr/hal-00672939; https://hal.inria.fr/hal-00672939/document; https://hal.inria.fr/hal-00672939/file/MainTCC.pdf

Dostupnost: https://hal.inria.fr/hal-00672939
https://hal.inria.fr/hal-00672939/document
https://hal.inria.fr/hal-00672939/file/MainTCC.pdf
https://doi.org/10.1007/978-3-642-28914-9_6

View record from BASE

Nájsť tento článok vo Web of Science

6

Counting Points on Genus 2 Curves with Real Multiplication

Autoři: Gaudry, Pierrick Kohel, David Smith, Benjamin a další

Přispěvatelé: Gaudry, Pierrick Kohel, David Smith, Benjamin a další

Zdroj: ASIACRYPT 2011 ; https://inria.hal.science/inria-00598029 ; ASIACRYPT 2011, International Association for Cryptologic Research, Dec 2011, Seoul, South Korea. pp.504-519, ⟨10.1007/978-3-642-25385-0_27⟩

Témata: ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Geografické téma: Seoul, South Korea

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1106.0661; ARXIV: 1106.0661

Dostupnost: https://inria.hal.science/inria-00598029
https://inria.hal.science/inria-00598029v1/document
https://inria.hal.science/inria-00598029v1/file/paper.pdf
https://doi.org/10.1007/978-3-642-25385-0_27

View record from BASE

Nájsť tento článok vo Web of Science

7

Generating Shorter Bases for Hard Random Lattices

Autoři: Alwen, Joël Peikert, Chris New York University a další

Přispěvatelé: Alwen, Joël Peikert, Chris New York University a další

Zdroj: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
https://hal.inria.fr/inria-00359718
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.75-86

Témata: lattices, random, short basis, average-case hardness, Hermite normal form, cryptography, ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures, ACM: G.: Mathematics of Computing/G.4: MATHEMATICAL SOFTWARE/G.4.0: Algorithm design and analysis, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Freiburg, Germany

Relation: inria-00359718; https://hal.inria.fr/inria-00359718; https://hal.inria.fr/inria-00359718/document; https://hal.inria.fr/inria-00359718/file/06-alwen.pdf

Dostupnost: https://hal.inria.fr/inria-00359718
https://hal.inria.fr/inria-00359718/document
https://hal.inria.fr/inria-00359718/file/06-alwen.pdf

View record from BASE

Nájsť tento článok vo Web of Science

8

DHWM: A Scheme for Managing Watermarking Keys in the Aquarelle Multimedia Distributed System

Autoři: Augot, Daniel Delaigle, Jean-François Fontaine, Caroline a další

Přispěvatelé: Augot, Daniel Delaigle, Jean-François Fontaine, Caroline a další

Zdroj: ESORICS 98 : 5th European Symposium on Research in Computer Security ; https://hal.inria.fr/hal-00723837 ; ESORICS 98 : 5th European Symposium on Research in Computer Security, Sep 1998, Louvain-la-Neuve, Belgium. pp.241-255, ⟨10.1007/BFb0055867⟩

Témata: ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]

Geografické téma: Louvain-la-Neuve, Belgium

Relation: hal-00723837; https://hal.inria.fr/hal-00723837; https://hal.inria.fr/hal-00723837/document; https://hal.inria.fr/hal-00723837/file/dhwm.pdf

Dostupnost: https://hal.inria.fr/hal-00723837
https://hal.inria.fr/hal-00723837/document
https://hal.inria.fr/hal-00723837/file/dhwm.pdf
https://doi.org/10.1007/BFb0055867

View record from BASE

Nájsť tento článok vo Web of Science

9

A three round authenticated group key agreement protocol for ad hoc networks

Autoři: Augot, Daniel Bhaskar, Raghav Issarny, Valérie a další

Přispěvatelé: Augot, Daniel Bhaskar, Raghav Issarny, Valérie a další

Zdroj: ISSN: 1574-1192 ; Pervasive and Mobile Computing ; https://hal.inria.fr/inria-00509215 ; Pervasive and Mobile Computing, Elsevier, 2007, 3 (1), pp.36-52. ⟨10.1016/j.pmcj.2006.07.001⟩ ; ttp://www.sciencedirect.com/science/article/B7MF1-4KTVPCX-1/2/69e95fcd91a4ec5a8dc05ed06301def5.

Témata: ACM: E.: Data/E.3: DATA ENCRYPTION/E.3.2: Public key cryptosystems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]