File: random_unittest.cc

package info (click to toggle)
chromium 138.0.7204.183-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 6,071,908 kB
  • sloc: cpp: 34,937,088; ansic: 7,176,967; javascript: 4,110,704; python: 1,419,953; asm: 946,768; xml: 739,971; pascal: 187,324; sh: 89,623; perl: 88,663; objc: 79,944; sql: 50,304; cs: 41,786; fortran: 24,137; makefile: 21,806; php: 13,980; tcl: 13,166; yacc: 8,925; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (33 lines) | stat: -rw-r--r-- 992 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
 
// Copyright 2012 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "crypto/random.h"

#include <stddef.h>

#include <algorithm>
#include <string>

#include "testing/gtest/include/gtest/gtest.h"

// Basic functionality tests. Does NOT test the security of the random data.

// Ensures we don't have all trivial data, i.e. that the data is indeed random.
// Currently, that means the bytes cannot be all the same (e.g. all zeros).
bool IsTrivial(base::span<const uint8_t> bytes) {
  const uint8_t first_byte = bytes.front();
  return std::ranges::all_of(bytes,
                             [=](uint8_t byte) { return byte == first_byte; });
}

TEST(RandBytes, RandBytes) {
  std::array<uint8_t, 16> bytes;
  crypto::RandBytes(bytes);
  EXPECT_FALSE(IsTrivial(bytes));
}

TEST(RandBytes, RandBytesAsVector) {
  std::vector<uint8_t> vector = crypto::RandBytesAsVector(16);
  EXPECT_FALSE(IsTrivial(vector));
}