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:(Random attacks). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Delft University of Technology

1. Dhiman, Ashish Kumar (author). Measuring the robustness of network controllability.

Degree: 2020, Delft University of Technology

Networks are all around us, telecommunication networks, road transportation networks, and the Internet are a few examples of networks that we encounter every day. The… (more)

Subjects/Keywords: Network controllability; Robustness; Targeted attacks; Random attacks; Machine Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dhiman, A. K. (. (2020). Measuring the robustness of network controllability. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:76b1aaca-f1f6-4eb5-9fbb-fec2fe443f10

Chicago Manual of Style (16th Edition):

Dhiman, Ashish Kumar (author). “Measuring the robustness of network controllability.” 2020. Masters Thesis, Delft University of Technology. Accessed November 30, 2020. http://resolver.tudelft.nl/uuid:76b1aaca-f1f6-4eb5-9fbb-fec2fe443f10.

MLA Handbook (7th Edition):

Dhiman, Ashish Kumar (author). “Measuring the robustness of network controllability.” 2020. Web. 30 Nov 2020.

Vancouver:

Dhiman AK(. Measuring the robustness of network controllability. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2020 Nov 30]. Available from: http://resolver.tudelft.nl/uuid:76b1aaca-f1f6-4eb5-9fbb-fec2fe443f10.

Council of Science Editors:

Dhiman AK(. Measuring the robustness of network controllability. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:76b1aaca-f1f6-4eb5-9fbb-fec2fe443f10

2. Ruhault, Sylvain. Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires.

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

La génération d’aléa joue un rôle fondamental en cryptographie et en sécurité. Des nombres aléatoires sont nécessaires pour la production de clés cryptographiques ou de… (more)

Subjects/Keywords: Générateurs de nombre pseudo-aléatoires; Modèles de sécurité; Robustesse; Attaques contre la mémoire; Attaques par canaux cachés; Linux /dev/random; OpenSSL; Java SecureRandom; Pseudo-random number generators; Security models; Robustness; Memory attacks; Side-channel attacks; Linux /dev/random; OpenSSL; Java SecureRandom; 005.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ruhault, S. (2015). Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires. (Doctoral Dissertation). Paris, Ecole normale supérieure. Retrieved from http://www.theses.fr/2015ENSU0014

Chicago Manual of Style (16th Edition):

Ruhault, Sylvain. “Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires.” 2015. Doctoral Dissertation, Paris, Ecole normale supérieure. Accessed November 30, 2020. http://www.theses.fr/2015ENSU0014.

MLA Handbook (7th Edition):

Ruhault, Sylvain. “Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires.” 2015. Web. 30 Nov 2020.

Vancouver:

Ruhault S. Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires. [Internet] [Doctoral dissertation]. Paris, Ecole normale supérieure; 2015. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2015ENSU0014.

Council of Science Editors:

Ruhault S. Security analysis for pseudo-random number generators : Analyse de sécurité pour les générateurs de nombre pseudo-aléatoires. [Doctoral Dissertation]. Paris, Ecole normale supérieure; 2015. Available from: http://www.theses.fr/2015ENSU0014

3. Bayon, Pierre. Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators.

Degree: Docteur es, Microélectronique, 2014, Saint-Etienne

Aujourd'hui, nous utilisons de plus en plus d'appareils "connectés" (téléphone portable, badge d'accès ou de transport, carte bancaire NFC, ...), et cette tendance ne va… (more)

Subjects/Keywords: Générateur d'aléa; Attaques électromagnétiques; Cryptographie; Sécurité matérielle; Oscillateur en anneau; Attaque en faute; Random number generator; Electromagnetic attacks; Cryptography; Hardware security; Ring oscillator; Attack at fault

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bayon, P. (2014). Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators. (Doctoral Dissertation). Saint-Etienne. Retrieved from http://www.theses.fr/2014STET4003

Chicago Manual of Style (16th Edition):

Bayon, Pierre. “Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators.” 2014. Doctoral Dissertation, Saint-Etienne. Accessed November 30, 2020. http://www.theses.fr/2014STET4003.

MLA Handbook (7th Edition):

Bayon, Pierre. “Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators.” 2014. Web. 30 Nov 2020.

Vancouver:

Bayon P. Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators. [Internet] [Doctoral dissertation]. Saint-Etienne; 2014. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2014STET4003.

Council of Science Editors:

Bayon P. Attaques électromagnétiques ciblant les générateurs d'aléa : Electromagnetic attacks on true random number generators. [Doctoral Dissertation]. Saint-Etienne; 2014. Available from: http://www.theses.fr/2014STET4003


Université du Luxembourg

4. Tibouchi, Mehdi. Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA.

Degree: 2011, Université du Luxembourg

 This thesis consists of two independent parts, devoted to both aspects of cryptology: construction and analysis. Contributions to cryptography proper, on the one hand, address… (more)

Subjects/Keywords: Cryptography; Elliptic Curves; Random Oracle; Provable Security; Cryptanalysis; RSA; Cryptosystem; EMV Specifications; Physical Attacks; 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):

Tibouchi, M. (2011). Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA. (Doctoral Dissertation). Université du Luxembourg. Retrieved from http://orbilu.uni.lu/handle/10993/15584

Chicago Manual of Style (16th Edition):

Tibouchi, Mehdi. “Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA.” 2011. Doctoral Dissertation, Université du Luxembourg. Accessed November 30, 2020. http://orbilu.uni.lu/handle/10993/15584.

MLA Handbook (7th Edition):

Tibouchi, Mehdi. “Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA.” 2011. Web. 30 Nov 2020.

Vancouver:

Tibouchi M. Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA. [Internet] [Doctoral dissertation]. Université du Luxembourg; 2011. [cited 2020 Nov 30]. Available from: http://orbilu.uni.lu/handle/10993/15584.

Council of Science Editors:

Tibouchi M. Hachage vers les courbes elliptiques et cryptanalyse de schémas RSA. [Doctoral Dissertation]. Université du Luxembourg; 2011. Available from: http://orbilu.uni.lu/handle/10993/15584


Brno University of Technology

5. Marek, Marcel. Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer.

Degree: 2019, Brno University of Technology

 This bachelor's thesis briefly describes the basic principles of SSH protocol, its architecture and used encryption. The thesis is mainly focused on datamining information from… (more)

Subjects/Keywords: ssh; honeypot; detekce botnetů; černá listina; slovníkové útoky; netflow; dolování dat; klasifikace; random forests; weka; ssh; honeypot; botnet detection; blacklist; dictionary attacks; netflow; data-mining; classification; random forests; weka; learning machine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marek, M. (2019). Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55797

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):

Marek, Marcel. “Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer.” 2019. Thesis, Brno University of Technology. Accessed November 30, 2020. http://hdl.handle.net/11012/55797.

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

MLA Handbook (7th Edition):

Marek, Marcel. “Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer.” 2019. Web. 30 Nov 2020.

Vancouver:

Marek M. Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Nov 30]. Available from: http://hdl.handle.net/11012/55797.

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

Council of Science Editors:

Marek M. Detekce útoků na službu ssh na úrovni netflow: Ssh Attacks Detection on Netflow Layer. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55797

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

6. Mefenza Nountu, Thierry. Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité.

Degree: Docteur es, Informatique, 2017, Paris Sciences et Lettres (ComUE); Université de Yaoundé I

L’aléatoire est un ingrédient clé en cryptographie. Par exemple, les nombres aléatoires sont utilisés pour générer des clés, pour le chiffrement et pour produire des… (more)

Subjects/Keywords: Fonctions pseudo-Aléatoires; Générateurs pseudo-Aléatoires; Signature à base de couplage; Discrépance; Interpolation polynomiale; Attaques à base de réseaux; Pseudo-Random functions; Pseudo-Random generators; Pairing-Based signatures; Discrepancy; Polynomial interpolation; Lattice attacks; 004; 652.8; 11

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mefenza Nountu, T. (2017). Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité. (Doctoral Dissertation). Paris Sciences et Lettres (ComUE); Université de Yaoundé I. Retrieved from http://www.theses.fr/2017PSLEE064

Chicago Manual of Style (16th Edition):

Mefenza Nountu, Thierry. “Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité.” 2017. Doctoral Dissertation, Paris Sciences et Lettres (ComUE); Université de Yaoundé I. Accessed November 30, 2020. http://www.theses.fr/2017PSLEE064.

MLA Handbook (7th Edition):

Mefenza Nountu, Thierry. “Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité.” 2017. Web. 30 Nov 2020.

Vancouver:

Mefenza Nountu T. Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité. [Internet] [Doctoral dissertation]. Paris Sciences et Lettres (ComUE); Université de Yaoundé I; 2017. [cited 2020 Nov 30]. Available from: http://www.theses.fr/2017PSLEE064.

Council of Science Editors:

Mefenza Nountu T. Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures : Générateurs et fonctions pseudo-aléatoires : cryptanalyse et mesures de complexité. [Doctoral Dissertation]. Paris Sciences et Lettres (ComUE); Université de Yaoundé I; 2017. Available from: http://www.theses.fr/2017PSLEE064


Queensland University of Technology

7. Rangasamy, Jothi Ramalingam. Cryptographic techniques for managing computational effort.

Degree: 2012, Queensland University of Technology

 Availability has become a primary goal of information security and is as significant as other goals, in particular, confidentiality and integrity. Maintaining availability of essential… (more)

Subjects/Keywords: denial-of-service, denial-of-service resilience, cryptographic puzzles, time-lock puzzles, puzzle-unforgeability, puzzle-diculty, non-parallelisability, mutual authentication, bernstein's signatures, secure sockets layer (ssl), public-key encryptionript:; timed-release encryption, key encapsulation mechanism, data encapsulation mechanism, encapsulated key escrow, ciphertext indistinguishability under chosen plaintext attacks and adaptive chosen ciphertext attacks, random Oracle model, standard model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rangasamy, J. R. (2012). Cryptographic techniques for managing computational effort. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/61007/

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):

Rangasamy, Jothi Ramalingam. “Cryptographic techniques for managing computational effort.” 2012. Thesis, Queensland University of Technology. Accessed November 30, 2020. https://eprints.qut.edu.au/61007/.

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

MLA Handbook (7th Edition):

Rangasamy, Jothi Ramalingam. “Cryptographic techniques for managing computational effort.” 2012. Web. 30 Nov 2020.

Vancouver:

Rangasamy JR. Cryptographic techniques for managing computational effort. [Internet] [Thesis]. Queensland University of Technology; 2012. [cited 2020 Nov 30]. Available from: https://eprints.qut.edu.au/61007/.

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

Council of Science Editors:

Rangasamy JR. Cryptographic techniques for managing computational effort. [Thesis]. Queensland University of Technology; 2012. Available from: https://eprints.qut.edu.au/61007/

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


Delft University of Technology

8. Gkorou, D. Exploiting Graph Properties for Decentralized Reputation Systems.

Degree: 2014, Delft University of Technology

 In online communities, users frequently interact with strangers in order to buy and sell products, watch videos, educating themselves, and playing games. Establishing trust among… (more)

Subjects/Keywords: trust; decentralized reputation systems; random walk; sybil attacks; network evolution; graphs; network analysis; social networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gkorou, D. (2014). Exploiting Graph Properties for Decentralized Reputation Systems. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7

Chicago Manual of Style (16th Edition):

Gkorou, D. “Exploiting Graph Properties for Decentralized Reputation Systems.” 2014. Doctoral Dissertation, Delft University of Technology. Accessed November 30, 2020. http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7.

MLA Handbook (7th Edition):

Gkorou, D. “Exploiting Graph Properties for Decentralized Reputation Systems.” 2014. Web. 30 Nov 2020.

Vancouver:

Gkorou D. Exploiting Graph Properties for Decentralized Reputation Systems. [Internet] [Doctoral dissertation]. Delft University of Technology; 2014. [cited 2020 Nov 30]. Available from: http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7.

Council of Science Editors:

Gkorou D. Exploiting Graph Properties for Decentralized Reputation Systems. [Doctoral Dissertation]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; urn:NBN:nl:ui:24-uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7 ; http://resolver.tudelft.nl/uuid:0fc40431-61ce-4bf6-b028-37c316e3e6b7

.