Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Lattice Based Cryptography). Showing records 1 – 16 of 16 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Ottawa

1. Jarvis, Katherine. NTRU over the Eisenstein Integers .

Degree: 2011, University of Ottawa

 NTRU is a fast public-key cryptosystem that is constructed using polynomial rings with integer coefficients. We present ETRU, an NTRU-like cryptosystem based on the Eisenstein… (more)

Subjects/Keywords: NTRU; Eisenstein Integers; Public Key Cryptography; Lattice Based Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jarvis, K. (2011). NTRU over the Eisenstein Integers . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/19862

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jarvis, Katherine. “NTRU over the Eisenstein Integers .” 2011. Thesis, University of Ottawa. Accessed October 29, 2020. http://hdl.handle.net/10393/19862.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jarvis, Katherine. “NTRU over the Eisenstein Integers .” 2011. Web. 29 Oct 2020.

Vancouver:

Jarvis K. NTRU over the Eisenstein Integers . [Internet] [Thesis]. University of Ottawa; 2011. [cited 2020 Oct 29]. Available from: http://hdl.handle.net/10393/19862.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jarvis K. NTRU over the Eisenstein Integers . [Thesis]. University of Ottawa; 2011. Available from: http://hdl.handle.net/10393/19862

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of California – San Diego

2. Walter, Michael. On the Concrete Security of Lattice-Based Cryptography.

Degree: Computer Science, 2017, University of California – San Diego

Lattice-based cryptography is an extraordinarily popular subfield of cryptography. But since it is also a very young field, practical proposals for lattice-based cryptographic primitives have… (more)

Subjects/Keywords: Computer science; Cryptography; Discrete Gaussian Sampling; Lattice Algorithms; Lattice-based Cryptography; Security Level

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Walter, M. (2017). On the Concrete Security of Lattice-Based Cryptography. (Thesis). University of California – San Diego. Retrieved from http://www.escholarship.org/uc/item/5n51z56s

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Walter, Michael. “On the Concrete Security of Lattice-Based Cryptography.” 2017. Thesis, University of California – San Diego. Accessed October 29, 2020. http://www.escholarship.org/uc/item/5n51z56s.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Walter, Michael. “On the Concrete Security of Lattice-Based Cryptography.” 2017. Web. 29 Oct 2020.

Vancouver:

Walter M. On the Concrete Security of Lattice-Based Cryptography. [Internet] [Thesis]. University of California – San Diego; 2017. [cited 2020 Oct 29]. Available from: http://www.escholarship.org/uc/item/5n51z56s.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Walter M. On the Concrete Security of Lattice-Based Cryptography. [Thesis]. University of California – San Diego; 2017. Available from: http://www.escholarship.org/uc/item/5n51z56s

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

3. Chuang, Yu-Lun. An Efficient Algorithm for the Shortest Vector Problem.

Degree: Master, Computer Science and Engineering, 2016, NSYSU

Lattice is widely used in cryptography since it has potential for defending quantum attacks. One of the significant problems in such cryptography is the shortest… (more)

Subjects/Keywords: Lattice; Algorithm Analysis; Optimization Theory; Lattice-Based Cryptography; Shortest Vector Problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chuang, Y. (2016). An Efficient Algorithm for the Shortest Vector Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-132326

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chuang, Yu-Lun. “An Efficient Algorithm for the Shortest Vector Problem.” 2016. Thesis, NSYSU. Accessed October 29, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-132326.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chuang, Yu-Lun. “An Efficient Algorithm for the Shortest Vector Problem.” 2016. Web. 29 Oct 2020.

Vancouver:

Chuang Y. An Efficient Algorithm for the Shortest Vector Problem. [Internet] [Thesis]. NSYSU; 2016. [cited 2020 Oct 29]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-132326.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chuang Y. An Efficient Algorithm for the Shortest Vector Problem. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0729116-132326

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Minho

4. Correia, Fábio José Gonçalves. Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs .

Degree: 2014, Universidade do Minho

Lattice-based cryptography has been a hot topic in the past decade, since it is believed that lattice-based cryptosystems are immune against attacks operated by quantum… (more)

Subjects/Keywords: Parallel computing; Lattice based cryptography; SVP; Voronoi cell

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Correia, F. J. G. (2014). Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs . (Masters Thesis). Universidade do Minho. Retrieved from http://hdl.handle.net/1822/36762

Chicago Manual of Style (16th Edition):

Correia, Fábio José Gonçalves. “Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs .” 2014. Masters Thesis, Universidade do Minho. Accessed October 29, 2020. http://hdl.handle.net/1822/36762.

MLA Handbook (7th Edition):

Correia, Fábio José Gonçalves. “Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs .” 2014. Web. 29 Oct 2020.

Vancouver:

Correia FJG. Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs . [Internet] [Masters thesis]. Universidade do Minho; 2014. [cited 2020 Oct 29]. Available from: http://hdl.handle.net/1822/36762.

Council of Science Editors:

Correia FJG. Assessing the hardness of SVP algorithms in the presence of CPUs and GPUs . [Masters Thesis]. Universidade do Minho; 2014. Available from: http://hdl.handle.net/1822/36762


NSYSU

5. YANG, QILIANG. Lattice-Based Group Authentication Scheme.

Degree: Master, Computer Science and Engineering, 2017, NSYSU

 Authentication has been adopted in many areas. But most of these authentication schemes are built on traditional cryptographic primitives. It is widely believed that such… (more)

Subjects/Keywords: Authentication; Quantum Attacks; Lattice-Based Cryptography; Quantum-Resistant Primitive; Group

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

YANG, Q. (2017). Lattice-Based Group Authentication Scheme. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721117-184627

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

YANG, QILIANG. “Lattice-Based Group Authentication Scheme.” 2017. Thesis, NSYSU. Accessed October 29, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721117-184627.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

YANG, QILIANG. “Lattice-Based Group Authentication Scheme.” 2017. Web. 29 Oct 2020.

Vancouver:

YANG Q. Lattice-Based Group Authentication Scheme. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Oct 29]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721117-184627.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YANG Q. Lattice-Based Group Authentication Scheme. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0721117-184627

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Royal Holloway, University of London

6. Player, Rachel. Parameter selection in lattice-based cryptography.

Degree: PhD, 2018, Royal Holloway, University of London

 Public-key cryptography in use today is based on classically hard problems such as factoring or solving discrete logarithms. These problems could be efficiently solved if… (more)

Subjects/Keywords: Lattice-based cryptography; Homomorphic encryption; Learning with errors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Player, R. (2018). Parameter selection in lattice-based cryptography. (Doctoral Dissertation). Royal Holloway, University of London. Retrieved from https://pure.royalholloway.ac.uk/portal/en/publications/parameter-selection-in-latticebased-cryptography(c54b603f-579b-48a0-8b69-8bde47b71455).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792806

Chicago Manual of Style (16th Edition):

Player, Rachel. “Parameter selection in lattice-based cryptography.” 2018. Doctoral Dissertation, Royal Holloway, University of London. Accessed October 29, 2020. https://pure.royalholloway.ac.uk/portal/en/publications/parameter-selection-in-latticebased-cryptography(c54b603f-579b-48a0-8b69-8bde47b71455).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792806.

MLA Handbook (7th Edition):

Player, Rachel. “Parameter selection in lattice-based cryptography.” 2018. Web. 29 Oct 2020.

Vancouver:

Player R. Parameter selection in lattice-based cryptography. [Internet] [Doctoral dissertation]. Royal Holloway, University of London; 2018. [cited 2020 Oct 29]. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/parameter-selection-in-latticebased-cryptography(c54b603f-579b-48a0-8b69-8bde47b71455).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792806.

Council of Science Editors:

Player R. Parameter selection in lattice-based cryptography. [Doctoral Dissertation]. Royal Holloway, University of London; 2018. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/parameter-selection-in-latticebased-cryptography(c54b603f-579b-48a0-8b69-8bde47b71455).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.792806

7. Johansson, Alexander. Performance analysis of lattice based post-quantum secure cryptography with Java.

Degree: Physics, 2019, Umeå University

  Efficient quantum computers will break most of today’s public-key cryptosystems. Therefore, the National Institute of Standards and Technology (NIST) calls for proposals to standardise… (more)

Subjects/Keywords: Cryptography; Post-quantum secure cryptography; Lattice-based cryptography; Learning with errors; Java; Other Computer and Information Science; Annan data- och informationsvetenskap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Johansson, A. (2019). Performance analysis of lattice based post-quantum secure cryptography with Java. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-164306

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Johansson, Alexander. “Performance analysis of lattice based post-quantum secure cryptography with Java.” 2019. Thesis, Umeå University. Accessed October 29, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-164306.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Johansson, Alexander. “Performance analysis of lattice based post-quantum secure cryptography with Java.” 2019. Web. 29 Oct 2020.

Vancouver:

Johansson A. Performance analysis of lattice based post-quantum secure cryptography with Java. [Internet] [Thesis]. Umeå University; 2019. [cited 2020 Oct 29]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-164306.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Johansson A. Performance analysis of lattice based post-quantum secure cryptography with Java. [Thesis]. Umeå University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-164306

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Linköping University

8. Eriksson, Hampus. Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card.

Degree: Information Coding, 2020, Linköping University

  Cyber attacks happen on a daily basis, where criminals can aim to disrupt internet services or in other cases try to get hold of… (more)

Subjects/Keywords: post-quantum; cryptography; lattice-based cryptography; quantum-resistant; Kyber; constrained device; performance; evaluation; implementation; Communication Systems; Kommunikationssystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Eriksson, H. (2020). Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-169039

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Eriksson, Hampus. “Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card.” 2020. Thesis, Linköping University. Accessed October 29, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-169039.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Eriksson, Hampus. “Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card.” 2020. Web. 29 Oct 2020.

Vancouver:

Eriksson H. Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card. [Internet] [Thesis]. Linköping University; 2020. [cited 2020 Oct 29]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-169039.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Eriksson H. Implementing and Evaluating the Quantum Resistant Cryptographic Scheme Kyber on a Smart Card. [Thesis]. Linköping University; 2020. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-169039

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Washington

9. More, Shruti Santosh. Discrete Gaussian Sampling for Low-Power Devices.

Degree: 2016, University of Washington

 Sampling from the discrete Gaussian probability distribution is used in lattice-based cryptosystems. A need for faster and memory-efficient samplers has become a necessity for improving… (more)

Subjects/Keywords: Discrete Gaussian Sampling; Lattice-based cryptography; Ziggurat algorithm; Computer science; Computer science and systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

More, S. S. (2016). Discrete Gaussian Sampling for Low-Power Devices. (Thesis). University of Washington. Retrieved from http://hdl.handle.net/1773/35093

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

More, Shruti Santosh. “Discrete Gaussian Sampling for Low-Power Devices.” 2016. Thesis, University of Washington. Accessed October 29, 2020. http://hdl.handle.net/1773/35093.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

More, Shruti Santosh. “Discrete Gaussian Sampling for Low-Power Devices.” 2016. Web. 29 Oct 2020.

Vancouver:

More SS. Discrete Gaussian Sampling for Low-Power Devices. [Internet] [Thesis]. University of Washington; 2016. [cited 2020 Oct 29]. Available from: http://hdl.handle.net/1773/35093.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

More SS. Discrete Gaussian Sampling for Low-Power Devices. [Thesis]. University of Washington; 2016. Available from: http://hdl.handle.net/1773/35093

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université du Luxembourg

10. Venkatesh, Srinivas Vivek. Practical Provable Security against Side-Channel Attacks.

Degree: 2015, Université du Luxembourg

 Securing cryptographic systems in the presence of side-channel leakages is still an important problem. Over recent years, the cryptography theory community has shown considerable interest… (more)

Subjects/Keywords: Cryptography; Side-channel attack; Countermeasure; Leakage-resilient cryptography; Provable security; Polynomial evaluation; Lattice-based attack; Generic group model; Engineering, computing & technology :: Computer science [C05]; Ingénierie, informatique & technologie :: Sciences informatiques [C05]

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Venkatesh, S. V. (2015). Practical Provable Security against Side-Channel Attacks. (Doctoral Dissertation). Université du Luxembourg. Retrieved from http://orbilu.uni.lu/handle/10993/21578

Chicago Manual of Style (16th Edition):

Venkatesh, Srinivas Vivek. “Practical Provable Security against Side-Channel Attacks.” 2015. Doctoral Dissertation, Université du Luxembourg. Accessed October 29, 2020. http://orbilu.uni.lu/handle/10993/21578.

MLA Handbook (7th Edition):

Venkatesh, Srinivas Vivek. “Practical Provable Security against Side-Channel Attacks.” 2015. Web. 29 Oct 2020.

Vancouver:

Venkatesh SV. Practical Provable Security against Side-Channel Attacks. [Internet] [Doctoral dissertation]. Université du Luxembourg; 2015. [cited 2020 Oct 29]. Available from: http://orbilu.uni.lu/handle/10993/21578.

Council of Science Editors:

Venkatesh SV. Practical Provable Security against Side-Channel Attacks. [Doctoral Dissertation]. Université du Luxembourg; 2015. Available from: http://orbilu.uni.lu/handle/10993/21578

11. Prest, Thomas. Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens.

Degree: Docteur es, Informatique, 2015, Paris, Ecole normale supérieure

Bien que relativement récente, la cryptographie à base de réseaux euclidiens s’est distinguée sur de nombreux points, que ce soit par la richesse des constructions… (more)

Subjects/Keywords: Cryptographie à clé publique; Réseaux euclidiens; Signatures numériques; Chiffrement basé sur l'identité; Cryptographie post-quantique; Cryptographie basée sur les réseaux; Gaussian sampling; Algorithmes; Public-key cryptography; Lattices; Digital signatures; Identity-based encryption; Post-quantum cryptography; Lattice-based cryptography; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Prest, T. (2015). Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens. (Doctoral Dissertation). Paris, Ecole normale supérieure. Retrieved from http://www.theses.fr/2015ENSU0045

Chicago Manual of Style (16th Edition):

Prest, Thomas. “Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens.” 2015. Doctoral Dissertation, Paris, Ecole normale supérieure. Accessed October 29, 2020. http://www.theses.fr/2015ENSU0045.

MLA Handbook (7th Edition):

Prest, Thomas. “Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens.” 2015. Web. 29 Oct 2020.

Vancouver:

Prest T. Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens. [Internet] [Doctoral dissertation]. Paris, Ecole normale supérieure; 2015. [cited 2020 Oct 29]. Available from: http://www.theses.fr/2015ENSU0045.

Council of Science Editors:

Prest T. Gaussian sampling in lattice-based cryptography : Le Gaussian sampling dans la cryptographie sur les réseaux euclidiens. [Doctoral Dissertation]. Paris, Ecole normale supérieure; 2015. Available from: http://www.theses.fr/2015ENSU0045

12. Roux-Langlois, Adeline. Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions.

Degree: Docteur es, Informatique, 2014, Lyon, École normale supérieure

La cryptographie reposant sur les réseaux Euclidiens est une branche récente de la cryptographie dans laquelle la sécurité des primitives repose sur la difficulté présumée… (more)

Subjects/Keywords: Cryptographie reposant sur les réseaux Euclidiens; Learning with Errors; Signature de Groupe; Applications multilinéaires cryptographiques; Lattice-based cryptography; Learning with Errors; Group signatures; Cryptographic multilinear maps

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Roux-Langlois, A. (2014). Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2014ENSL0940

Chicago Manual of Style (16th Edition):

Roux-Langlois, Adeline. “Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions.” 2014. Doctoral Dissertation, Lyon, École normale supérieure. Accessed October 29, 2020. http://www.theses.fr/2014ENSL0940.

MLA Handbook (7th Edition):

Roux-Langlois, Adeline. “Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions.” 2014. Web. 29 Oct 2020.

Vancouver:

Roux-Langlois A. Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2014. [cited 2020 Oct 29]. Available from: http://www.theses.fr/2014ENSL0940.

Council of Science Editors:

Roux-Langlois A. Lattice - Based Cryptography - Security Foundations and Constructions : Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions. [Doctoral Dissertation]. Lyon, École normale supérieure; 2014. Available from: http://www.theses.fr/2014ENSL0940


Indian Institute of Science

13. Kallol, Roy. Quantum Algorithmic Engineering with Photonic Integrated Circuits.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 Integrated quantum photonics show monolithic waveguide chips to be a promising platform for realizing the next generation of quantum optical circuits. This work proposes the… (more)

Subjects/Keywords: Integrated Quantum Photonics; Quantum Algorithms; Photonic Integrated Circuits; Quantum Stochasic Walk; Photonic Waveguide Lattice; Quantum Cryptography; Quantum PageRank Algorithm; Quantum Walk Based Open Graph Search; Facebook Open Graph Search; Quantum Walk on Graph; Quantum Algorithm Encoding; Kolmogorov Complexity; Google Quantum PageRank; Photonic Lattice; Quantum Decoherence; Quantum Circuits; Electronic Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kallol, R. (2018). Quantum Algorithmic Engineering with Photonic Integrated Circuits. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3451

Chicago Manual of Style (16th Edition):

Kallol, Roy. “Quantum Algorithmic Engineering with Photonic Integrated Circuits.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed October 29, 2020. http://etd.iisc.ac.in/handle/2005/3451.

MLA Handbook (7th Edition):

Kallol, Roy. “Quantum Algorithmic Engineering with Photonic Integrated Circuits.” 2018. Web. 29 Oct 2020.

Vancouver:

Kallol R. Quantum Algorithmic Engineering with Photonic Integrated Circuits. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Oct 29]. Available from: http://etd.iisc.ac.in/handle/2005/3451.

Council of Science Editors:

Kallol R. Quantum Algorithmic Engineering with Photonic Integrated Circuits. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3451

14. Kamel, Sarah. Sécurité pour les réseaux sans fil : Security for wireless communications.

Degree: Docteur es, Electronique et communications, 2017, Paris, ENST

Aujourd’hui, le renforcement de la sécurité des systèmes de communications devient une nécessité, par anticipation du développement des ordinateurs quantiques et des nouvelles attaques qui… (more)

Subjects/Keywords: Cryptographie sur réseau; Cryptosystème Goldrei-Goldwasser-Halevi (GGH); Chaînes de diffusion; Systèmes de mise en mémoire cache; Capacité de sécurité; Lattice-based cryptography; Goldreich-Goldwasser-Halevi cryptosystem (GGH); Broadcast channels; Caching systems; Secrecy capacity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kamel, S. (2017). Sécurité pour les réseaux sans fil : Security for wireless communications. (Doctoral Dissertation). Paris, ENST. Retrieved from http://www.theses.fr/2017ENST0011

Chicago Manual of Style (16th Edition):

Kamel, Sarah. “Sécurité pour les réseaux sans fil : Security for wireless communications.” 2017. Doctoral Dissertation, Paris, ENST. Accessed October 29, 2020. http://www.theses.fr/2017ENST0011.

MLA Handbook (7th Edition):

Kamel, Sarah. “Sécurité pour les réseaux sans fil : Security for wireless communications.” 2017. Web. 29 Oct 2020.

Vancouver:

Kamel S. Sécurité pour les réseaux sans fil : Security for wireless communications. [Internet] [Doctoral dissertation]. Paris, ENST; 2017. [cited 2020 Oct 29]. Available from: http://www.theses.fr/2017ENST0011.

Council of Science Editors:

Kamel S. Sécurité pour les réseaux sans fil : Security for wireless communications. [Doctoral Dissertation]. Paris, ENST; 2017. Available from: http://www.theses.fr/2017ENST0011


Indian Institute of Science

15. Francis, Maria. Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings.

Degree: PhD, Faculty of Engineering, 2018, Indian Institute of Science

 One of the fundamental problems in commutative algebra and algebraic geometry is to understand the nature of the solution space of a system of multivariate… (more)

Subjects/Keywords: Grobuer Basis Algorithms; Polynomial Ideal Theory; Buchberger's Algorithm; Affine K-algebra; Polynomial Rings; Grobuer Basis; Grobuer Bases; Macaulay-Buchberger Basis Theorem; Noetherian Rings; Lattice Based Cryptography; Ideal Lattices; Hilbert Polynomials; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Francis, M. (2018). Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings. (Doctoral Dissertation). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3543

Chicago Manual of Style (16th Edition):

Francis, Maria. “Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings.” 2018. Doctoral Dissertation, Indian Institute of Science. Accessed October 29, 2020. http://etd.iisc.ac.in/handle/2005/3543.

MLA Handbook (7th Edition):

Francis, Maria. “Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings.” 2018. Web. 29 Oct 2020.

Vancouver:

Francis M. Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings. [Internet] [Doctoral dissertation]. Indian Institute of Science; 2018. [cited 2020 Oct 29]. Available from: http://etd.iisc.ac.in/handle/2005/3543.

Council of Science Editors:

Francis M. Grobuer Basis Algorithms for Polynomial Ideal Theory over Noetherian Commutative Rings. [Doctoral Dissertation]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3543

16. Minelli, Michele. Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique.

Degree: Docteur es, Informatique, 2018, Paris Sciences et Lettres (ComUE)

Le chiffrement totalement homomorphe permet d’effectuer des calculs sur des données chiffrées sans fuite d’information sur celles-ci. Pour résumer, un utilisateur peut chiffrer des données,… (more)

Subjects/Keywords: Chiffrement à base de réseaux euclidiens; Chiffrement totalement homomorphe; Informatique en nuage; Apprentissage automatique; Confidentialité du circuit; Recherche d'information confidentielle; Lattice based cryptography; Fully homomorphic encryption; Cloud computing; Machine learning; Circuit privacy; Private information retrieval; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Minelli, M. (2018). Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE). Retrieved from http://www.theses.fr/2018PSLEE056

Chicago Manual of Style (16th Edition):

Minelli, Michele. “Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique.” 2018. Doctoral Dissertation, Paris Sciences et Lettres (ComUE). Accessed October 29, 2020. http://www.theses.fr/2018PSLEE056.

MLA Handbook (7th Edition):

Minelli, Michele. “Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique.” 2018. Web. 29 Oct 2020.

Vancouver:

Minelli M. Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); 2018. [cited 2020 Oct 29]. Available from: http://www.theses.fr/2018PSLEE056.

Council of Science Editors:

Minelli M. Fully homomorphic encryption for machine learning : Chiffrement totalement homomorphe pour l'apprentissage automatique. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); 2018. Available from: http://www.theses.fr/2018PSLEE056

.