File: random_unittest.cc

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; 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));
}