Boolean Functions are fundamental tools in the design of several cryptographic algorithms. They a... more Boolean Functions are fundamental tools in the design of several cryptographic algorithms. They are used for designing S-boxes in block ciphers and utilized as filters in stream ciphers. Constructing bal- anced boolean functions with high nonlinearity is a significant study area in Boolean functions. In this paper, we construct several classes of highly nonlinear balanced boolean functions by adding two particular boolean functions to a bent function which generalizes Dobbertin's construction, in: Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1008, Springer, Berlin, 1994, pp. 61-74.
... Booléennes: Cryptographie & Applications A METHOD OF CONSTRUCTING HIGHLY NONLINEAR BALANC... more ... Booléennes: Cryptographie & Applications A METHOD OF CONSTRUCTING HIGHLY NONLINEAR BALANCED BOOLEAN FUNCTIONS Baha Güclü Dündar1, Faruk Göloglu1, 2, Ali ... with algebraic degree d satisfies the inequality d≤ n− m with m< n. Xiao and Massey gave ...
The Second International Conference on Availability, Reliability and Security (ARES'07), 2007
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: priva... more We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, individual verifiability, and universal verifiability. Unlike existing e-voting protocols we employ dynamic ballot instead of pre- defined usual ballot in order to strengthen accuracy and fairness of the protocol. In dynamic ballots, the ordering of candidates in the ballots is dynamically created
The Second International Conference on Availability, Reliability and Security (ARES'07), 2007
... Orhan Cetinkaya Institute of Applied Mathematics, METU, Ankara, Turkey e113754@metu.edu. tr .... more ... Orhan Cetinkaya Institute of Applied Mathematics, METU, Ankara, Turkey e113754@metu.edu. tr ... On the other hand, instead of making channel anonymous if we provide anonymous credentials to voter, we can easily hide voter's identity without any need of anonymous channels ...
Abstract. Statistical randomness testing plays an important role in security analysis of cryptosy... more Abstract. Statistical randomness testing plays an important role in security analysis of cryptosystems. In this study, we aim to propose a new framework of randomness testing based on random mappings. Considering the probability distributions of coverage and ...
Cryptographic Randomness Testing of Block Ciphers and Hash Functions Ali Do˘ganaksoy, Barıs Ege, ... more Cryptographic Randomness Testing of Block Ciphers and Hash Functions Ali Do˘ganaksoy, Barıs Ege, Onur Koçak and Fatih Sulak Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey {aldoks,baris.ege,onur.kocak,sulak}@metu.edu.tr Abstract. ...
Abstract. We derive recurrences for counting the number a(n,r) of sequences of length n with Lemp... more Abstract. We derive recurrences for counting the number a(n,r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute,these recurrences. We employed,these algorithms to compute a(n,r) and expected value, EPn, of number of patterns of a sequence of length n, for relatively large n.
Boolean Functions are fundamental tools in the design of several cryptographic algorithms. They a... more Boolean Functions are fundamental tools in the design of several cryptographic algorithms. They are used for designing S-boxes in block ciphers and utilized as filters in stream ciphers. Constructing bal- anced boolean functions with high nonlinearity is a significant study area in Boolean functions. In this paper, we construct several classes of highly nonlinear balanced boolean functions by adding two particular boolean functions to a bent function which generalizes Dobbertin&amp;#x27;s construction, in: Fast Software Encryption, Lecture Notes in Computer Science, Vol. 1008, Springer, Berlin, 1994, pp. 61-74.
... Booléennes: Cryptographie & Applications A METHOD OF CONSTRUCTING HIGHLY NONLINEAR BALANC... more ... Booléennes: Cryptographie & Applications A METHOD OF CONSTRUCTING HIGHLY NONLINEAR BALANCED BOOLEAN FUNCTIONS Baha Güclü Dündar1, Faruk Göloglu1, 2, Ali ... with algebraic degree d satisfies the inequality d≤ n− m with m< n. Xiao and Massey gave ...
The Second International Conference on Availability, Reliability and Security (ARES'07), 2007
We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: priva... more We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, individual verifiability, and universal verifiability. Unlike existing e-voting protocols we employ dynamic ballot instead of pre- defined usual ballot in order to strengthen accuracy and fairness of the protocol. In dynamic ballots, the ordering of candidates in the ballots is dynamically created
The Second International Conference on Availability, Reliability and Security (ARES'07), 2007
... Orhan Cetinkaya Institute of Applied Mathematics, METU, Ankara, Turkey e113754@metu.edu. tr .... more ... Orhan Cetinkaya Institute of Applied Mathematics, METU, Ankara, Turkey e113754@metu.edu. tr ... On the other hand, instead of making channel anonymous if we provide anonymous credentials to voter, we can easily hide voter's identity without any need of anonymous channels ...
Abstract. Statistical randomness testing plays an important role in security analysis of cryptosy... more Abstract. Statistical randomness testing plays an important role in security analysis of cryptosystems. In this study, we aim to propose a new framework of randomness testing based on random mappings. Considering the probability distributions of coverage and ...
Cryptographic Randomness Testing of Block Ciphers and Hash Functions Ali Do˘ganaksoy, Barıs Ege, ... more Cryptographic Randomness Testing of Block Ciphers and Hash Functions Ali Do˘ganaksoy, Barıs Ege, Onur Koçak and Fatih Sulak Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey {aldoks,baris.ege,onur.kocak,sulak}@metu.edu.tr Abstract. ...
Abstract. We derive recurrences for counting the number a(n,r) of sequences of length n with Lemp... more Abstract. We derive recurrences for counting the number a(n,r) of sequences of length n with Lempel-Ziv complexity r, which has important applications, for instance testing randomness of binary sequences. We also give algorithms to compute,these recurrences. We employed,these algorithms to compute a(n,r) and expected value, EPn, of number of patterns of a sequence of length n, for relatively large n.
Uploads
Papers by Ali Doganaksoy